#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
#define pb push_back
#define MAXN 100005
int n,m,s,x,y,D[MAXN];
bool used[MAXN];
vector<int> G[MAXN];
queue<int> Q;
void solve(){
    Q.push(s);
    used[s]=1;
    D[s]=1;
    while(!Q.empty()){
        int node = Q.front(); Q.pop();
        for(auto p : G[node])
            if(!used[p]){
                used[p]=1;
                Q.push(p);
                D[p]=D[node]+1;
            }
    }
}

int main()
{
    fin>>n>>m>>s;
    while(m--){
        fin>>x>>y;
        G[x].pb(y);
    }
    solve();
    for(int i=1;i<=n;i++)
        fout<<D[i]-1<<" ";
	return 0;
}