#include <bits/stdc++.h>


using namespace std;

vector<int>G[100005];
int d[100005],n,m,s;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int main(){
    fin>>n>>m>>s;
    while(m--){
        int x,y; fin>>x>>y;
        G[x].push_back(y);
    }
    queue<int>Q;
    Q.push(s);
    d[s]=1;
    while(!Q.empty()){
        int top = Q.front();
        Q.pop();
        for(auto x : G[top])
            if(d[x]>d[top]+1 || d[x]==0)
                Q.push(x),d[x]=d[top]+1;
    }
    for(int i=1;i<=n;i++)
    {
        d[i]--;

        if(d[i]==0 && i!=s)
            fout<<-1<<" ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}