#include <fstream>
#include <queue>
#include <vector>

using namespace std;

ifstream cin ("bfs.in");
ofstream cout ("bfs.out");

int v[100001],n,m,comp[100001],S;
vector <int> M[100001];
queue <int> Q;

void bfs (int x)
{
    v[x]=0;
    Q.push(x);
    while (!Q.empty())
    {
        int a=Q.front();
        Q.pop();
        for (int i=0; i<M[a].size(); ++i)
            if (v[M[a][i]]==-1){
                v[M[a][i]]=v[a]+1;
                Q.push(M[a][i]);
            }
    }
}

int main()
{
    cin>>n>>m>>S;
    for (int i=1; i<=m; ++i)
    {
        int x,y;
        cin>>x>>y;
        M[x].push_back(y);
    }

    for(int i=1; i<=n; i++) v[i]=-1;
    bfs(S);
    for (int i=1; i<=n; ++i) cout<<v[i]<<" ";

    return 0;
}