#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <bitset>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> a[100005];
bitset <100005> viz;
vector <int > :: iterator it;
queue <int> q;
int n,m,x,y,i,j,k,vecin,nod;
int d[100005];
int main()
{
    in>>n>>m>>k;
    for(i=1;i<=m;++i)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    viz[k]=true;
    d[k]=0;
    q.push(k);
    while(!q.empty()){
        nod = q.front();
       // out<<nod<<' ';
        q.pop();
        for(it=a[nod].begin();it!=a[nod].end();++it){
            vecin=*it;
            if(viz[vecin]==0 ){
                d[vecin]=d[nod]+1;
                viz[vecin]=true;
                q.push(vecin);
            }
        }

    }
   for(i=1;i<=n;++i) {
        if(viz[i]==0) out<<-1<<' ';
        else out<<d[i]<<' ';
    }
    return 0;
}