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

using namespace std;

ifstream f ("bfs.in");
ofstream t ("bfs.out");

struct nod{
int val;
vector <int> vecini;};

vector <nod> v(100010);
vector <int> sol(100010,-1);
queue <int> q;


void bfs(int nod){int curent;
    sol[nod]=0;
    q.push(nod);
    while (!q.empty()){
    curent=q.front();
    q.pop();
        for (int i=0;i<v[curent].vecini.size();++i)
            if (sol[v[curent].vecini[i]]==-1){
            q.push(v[curent].vecini[i]);
            sol[v[curent].vecini[i]]=sol[curent]+1;}
    }
}

int main()
{   int n,m,s,x,y;
    f>>n>>m>>s;
    for (int i=0;i<m;++i){
        f>>x>>y;
        v[x-1].vecini.push_back(y-1);
    }
    bfs(s-1);
    for (int i=0;i<n;++i)
        t<<sol[i]<<" ";
    return 0;
}