#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

vector<int> a[100001];
queue<int> coada;
int viz[100001];
int main()
{
    long n,m,s,i,x,y;
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f>>n>>m>>s;
    for(i=0;i<m;i++){
        f>>x>>y;
        a[x].push_back(y);
    }
    coada.push(s);
    int el=0;
    viz[s]=1;
    while(!coada.empty()){
        el=coada.front();
        for(i=0;i<a[el].size();i++){
            if(viz[a[el][i]]==0){
                coada.push(a[el][i]);
                viz[a[el][i]]=viz[el]+1;
            }
        }
        coada.pop();
    }

    for(i=1;i<=n;i++){
        if(viz[i]==0)
            viz[i]=0;
        if(i==s)
            viz[i]=1;
        g<<viz[i]-1<<" ";
    }
    return 0;
}