#include <bits/stdc++.h>

using namespace std;

int n,i,s,m,a,b,dist[100005];
vector <int> v[100005];
queue <int> q;

int main() 
{
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    cin>>n>>m>>s;
    for (int i=1; i<=m; i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
    }
    
    q.push(s);
    dist[s]=1;
    while (!q.empty()){
        a=q.front();
        q.pop();
        for (int i=0; i<v[a].size(); i++)
            if (dist[v[a][i]]==0) {
                dist[v[a][i]]=dist[a]+1;
                q.push(v[a][i]);
            }
    }
    
    for (int i=1; i<=n; i++)
        if (i==s) cout<<"0 "; else
            if (dist[i]==0 && i!=s) cout<"-1 "; else cout<<dist[i]-1<<" ";
}