#include <bits/stdc++.h>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int NMAX=100005;

int N,M,S;

int viz[NMAX];

vector < int > Ad[NMAX];
queue < int > C;

void read()
{
    fin>>N>>M>>S;

    int x,y,w,u;

    for(int i=1;i<=M;++i)
    {
        fin>>x>>y;
        Ad[x].push_back(y);
    }

    C.push(S);

    viz[S]=1;

    while(!C.empty())
    {
        u=C.front();
        C.pop();

        for(int i=0;i<Ad[u].size();++i)
        {
            w=Ad[u][i];

            if(viz[w]==0)
            {
                viz[w]=viz[u]+1;
                C.push(w);
            }
        }
    }

    for(int i=1;i<=N;++i) fout<<viz[i]-1<<" ";

}

int main()
{
    read();
    return 0;
}