//#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
queue <pair<int,int> > q;
vector<int> v[100005];
int d[100005];
int main()
{
    int n,m,s,a,b;
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        cin>>a>>b;
        v[a].push_back(b);
    }
    q.push(make_pair(s,0));
    while(q.empty()==false){
        pair<int,int> x=q.front();
        q.pop();
        for(auto u:v[x.first]){
            if(d[u]==0){
                d[u]=x.second+1;
                q.push(make_pair(u,x.second+1));
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(s==i){
            cout<<0<<" ";
            continue;
        }
        if(d[i]==0)
            d[i]=-1;
        cout<<d[i]<<" ";
    }
    return 0;
}