//#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
queue <int> q;
vector<int> v[100005];
int f[100005];
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int main()
{
    int n,m,s,x,y;
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        v[x].push_back(y);
        f[x]=-1;
        f[y]=-1;
    }
    q.push(s);
    f[s]=0;
    while(q.empty()==false){
        x=q.front();
        q.pop();
        for(int i=0;i<v[x].size();i++){
            if(f[v[x][i]]==-1){
                f[v[x][i]]=f[x]+1;
                q.push(v[x][i]);
            }
        }
    }

    for(int i=1;i<=n;i++){
        cout<<f[i]<<" ";
    }
    return 0;
}