#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second

const long double PI = acos(-1);

template<class T>
class ListsGraph
{
public:
   const int n;
   vector< vector<T> > adj;

   ListsGraph(int n) : n(n)
   {
      for (int i = 0; i < n; i++) adj.push_back(vector<T>());
   }

   void addEdge(int x, T edge)
   {
      adj[x].push_back(edge);
   }
};

template<class T>
class BFS
{
public:
   static vector<int> run(const ListsGraph<T>& g, 
                           int start, 
                           int (*getTo) (T edge), 
                           int inexistent = -1,
                           void (*visit) (int node) = [](int node) { })
   {
      vector<int> Visited(g.n);
      fill(Visited.begin(), Visited.end(), inexistent);
      deque<int> Queue;
      Queue.push_back(start);
      Visited[start] = 0;
      while (!Queue.empty())
      {
         int front = Queue.front();
         visit(front);
         Queue.pop_front();
         for (T edge : g.adj[front])
         {
            int to = getTo(edge);
            if (Visited[to] == inexistent)
            {
               Queue.push_back(to);
               Visited[to] = Visited[front] + 1;
            }
         }
      }
      return Visited;
   }
};


int main()
{
   ios::sync_with_stdio(false);

   // freopen("bfs.in", "r", stdin);
   // freopen("bfs.out", "w", stdout);
   int n, m, s;
   cin >> n >> m >> s;
   ListsGraph<int> g(n);
   for (int i=1; i<=m; i++)
   {
      int x, y;
      cin >> x >> y; x--, y--;
      g.addEdge(x, y);
   }
   vector<int> A = BFS<int>::run(g, s - 1, [](int y) { return y; });
   for (auto i : A)
   {
      cout << i << " ";
   }
   return 0;
}