// algoritm bfs
#pragma GCC optimize("unroll-loops")
#pragma GCC foptimize("fast-math")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
int n, m, initial, x, y, cost[nmax];
vector<int> v[100005];
queue<int>q;
void bfs(int nod)
{
    memset(cost, -1, sizeof cost);
    cost[nod] = 0;
    q.push(nod);
    while(!q.empty())
    {
        for(int i = 0; i < v[q.front()].size(); ++i)
        {
            if(cost[v[q.front()][i]] == -1)
            {
                q.push(v[q.front()][i]);
                cost[v[q.front()][i]] = cost[q.front()] + 1;
            }
        }
        q.pop();
    }
}
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int32_t main()
{
    fin >> n >> m >> initial;
    for(int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    bfs(initial);
    for(int i = 1; i <= n; ++i)
    {
        fout << cost[i] << " ";
    }
    return 0;
}