#include<bits/stdc++.h>
using namespace std;
ifstream f("bfs.in"); ofstream g("bfs.out");
int n, m, viz[100005];
vector <int> graf[100005];
queue <int> q;
void BFS(int x)
{   viz[x] = 1;
    q.push(x);
    while (!q.empty())
    {   x = q.front();
        q.pop();
        for (int i = 0; i < graf[x].size(); i++)
        {   if (viz[graf[x][i]] == 0)
            {   viz[graf[x][i]] = viz[x] + 1;
                q.push(graf[x][i]);
            }
        }
    }
}
int main()
{   int X, x, y;
    f>>n>>m>>X;
    for (int i = 0; i < m; i++)
    {   f>>x>>y;
        graf[x].push_back(y);
    }
    BFS(X);
    for(int i=1;i<=n;i++) g<<viz[i]-1<<" ";
    return 0;
}