#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

int N,M,i,S,d[100005],x,y;
queue<int> Q;
vector<int> v[100005];
int main()
{
    f>>N>>M>>S;
    while(M--)f>>x>>y,v[x].push_back(y);

    for (i=1;i<=N;++i)
        d[i]=-1;
    d[S]=0;

    Q.push(S);
    while(!Q.empty())
        {
            int cr=Q.front();Q.pop();
            for (i=0;i<v[cr].size();++i)
                if (d[v[cr][i]]==-1)
                    d[v[cr][i]]=d[cr]+1,Q.push(v[cr][i]);
        }
    for(i=1;i<=N;++i)
        g<<d[i]<<" ";
    g << '\n';
    g.close();



    return 0;
}