#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define MaxN 100005
fstream in ("bfs.in",ios::in);
fstream out ("bfs.out",ios::out);
vector <int> G[MaxN];
queue <int> que;
int dist[MaxN];

int main()
{
    int N,M,S;
    in>>N>>M>>S;
    for (int i=0;i<M;i++)
    {
        int x,y;
        in>>x>>y;
        G[x].push_back(y);
    }
    que.push(S);

    while(!que.empty())
    {
        int nod;
        nod=que.front();
        que.pop();
        for (int i=0;i<G[nod].size();i++)
        {
            if(!dist[G[nod][i]] && S != G[nod][i]) {
                que.push(G[nod].at(i));
                dist[G[nod][i]]=dist[nod]+1;
            }
        }
    }
    for (int i=1;i<=N;i++)
    {
        if (!dist[i])
            dist[i]=-1;
    }
    dist[S]=0;
    for (int i=1;i<=N;i++)
    {
        out<<dist[i]<<' ';
    }
}