#include <bits/stdc++.h>
#define DM 100005
#define pb push_back
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

queue<int>Q;
vector<int>v[DM];
bitset<DM>viz;
int n,m,s,x,y,dist[DM];

int main()
{
    fin>>n>>m>>s;
    while(m--){
        fin>>x>>y;
        v[x].pb(y);
    }

    memset(dist,INF,sizeof(dist));
    dist[s]=0;
    Q.push(s);
    while(!Q.empty()){
        int nod = Q.front();
        viz[nod]=1;
        for(auto i:v[nod]) if(!viz[i] && dist[i]>dist[nod]+1)
            Q.push(i),dist[i]=dist[nod]+1;
        Q.pop();
    }
    for(int i=1;i<=n;++i)
        fout<<(dist[i]==INF?-1:dist[i])<<" ";

    return 0;
}