#include <fstream>
#include <vector>
using namespace std;

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

#define NMAX 100001

vector<int> adj[NMAX];
int q[NMAX],viz[NMAX];
int d[NMAX],S;

void bfs(int nod){
    int st=1,dr=1;
    d[S] = 0;
    q[1] = S;
    while(dr-st+1>0){
        nod = q[st];
        st++;
        for(int i=0;i<adj[nod].size();i++){
            if(d[adj[nod][i]] == 0 || d[adj[nod][i]]>d[nod]+1){
                d[adj[nod][i]]=d[nod]+1;
                dr++;
                q[dr]=adj[nod][i];
            }
        }
    }
}

int main()
{

    int N,M,x,y,i;
    fin>>N>>M>>S;
    for(i = 0; i < M; i++){
        fin>>x>>y;
        adj[x].push_back(y);
    }
    S = S+1;
    bfs(S);
    for(i = 1; i <= N; i++){
        fout<<d[i]-1<<" ";
    }
}