#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[1000000], k, out[100000];
unordered_map <int, vector<int> > lv;
deque<int> q;

void bf(int s){
q.push_back(s);
while(!q.empty()){
        x=q.front();
        ++k;
    vector<int>::iterator it;
    c[x]=1;
    for(it=lv[x].begin(); it!=lv[x].end(); ++it)
        if(!c[*it]){
        out[*it]=out[x]+1;
        q.push_back(*it);
//    cout<<*it<<' '<<out[*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(out[i]==0&&i!=s) g<<-1<<' ';

    else g<<out[i]<<' ';

    return 0;
}