#include <iostream>
#include <fstream>
#include <deque>
#include <unordered_map>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m, s, a, b, x, c[1000001];
vector<int> lv[1000001];
vector<int>::iterator it;
deque<int> q;

void bf(int a){
q.push_back(a);
while(!q.empty()){
        x=q.front();
    for(it=lv[x].begin(); it!=lv[x].end(); ++it)
        if(!c[*it]&&*it!=s){
        c[*it]=c[x]+1;
        q.push_back(*it);
   //cout<<*it<<' '<<c[*it]<<'\n';

    }
    q.pop_front();

}



}

int main()
{
f>>n>>m>>s;
for(int i=0; i<m; ++i) f>>a>>b, lv[a].push_back(b);
bf(s);
for(int i=1; i<=n; ++i)
    if(c[i]==0&&i!=s) g<<-1<<' ';
    else g<<c[i]<<' ';

    return 0;
}