#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <bitset>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> G[100001];
queue <int> Q;
bitset <100001> viz;
int dist [1000001];

void BFS(int nod)
{
    while(Q.empty()==0) //coada nu e vida
    {
        nod=Q.front();
        for(int i=0;i<G[nod].size();i++)
        {
            if(viz[G[nod][i]]==0)
            {
                dist[G[nod][i]]=dist[nod]+1;
                Q.push(G[nod][i]);
                viz[G[nod][i]]=1;
            }
        }
        Q.pop();
    }
}

int main()
{
    int i,N,M,S,a,b;
    f>>N>>M>>S;
    for(i=1;i<=M;i++)
    {
        f>>a>>b;
        G[a].push_back(b);
    }
    Q.push(S); viz[S]=1; dist[S]=0;
    BFS(S);
    for(i=1;i<=N;i++)
        if(viz[i]==1)
            g<<dist[i]<<" ";
        else
            g<<-1<<" ";
    return 0;
}