#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> m[100005];
deque <int> s;
int dist[100005];
bool viz[100005];
void bfs(int node){
    int i=0,j;
    viz[node]=1;
    dist[node]=0;
    s.push_back(node);
    while(s.empty()==0){
        node=s[0];
        for(i=0;i<m[node].size();i++)
        if(viz[m[node][i]]==0){
            s.push_back(m[node][i]);
            dist[m[node][i]]=dist[s[i]]+1;
            viz[m[node][i]]=1;
        }
        s.pop_front();
    }
}
int main()
{
    int n,mu,i,x,y,node;
    f>>n>>mu>>node;
    for(i=1;i<=mu;i++){
        f>>x>>y;
        m[x].push_back(y);
    }
    bfs(node);
    for(i=1;i<=n;i++){
        if(node==i)
            g<<0<<" ";
        else if(dist[i]==0)
            g<<-1<<" ";
        else
            g<<dist[i]<<" ";
    }

    return 0;
}