#include <bits/stdc++.h>

using namespace std;
int n,m,x,y,s;
vector <int> adj[100001];
int cost[100001],viz[100001];
void bfs(int nod){
queue<int> q;
q.push(nod);
cost[nod]=0;
while(!q.empty()){
int curr=q.front();
viz[curr]=1;
q.pop();
for(auto x:adj[curr])
    if(!viz[x]){
    cost[x]=cost[curr]+1;
    q.push(x);
    viz[x]=1;
    }
}
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m>>s;
    while(m--){
        cin>>x>>y;
        adj[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;++i)
        cout<<(cost[i]==0?(i==s?0:-1):cost[i])<<" ";
}