#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,s,i,a,b,mark[100005],nod,vecin;
vector <int> v[100005];

void BFS(int start){
    mark[start] = 1;
    queue <int> Q;
    Q.push(start);
    while(!Q.empty()){
        nod = Q.front();
        Q.pop();
        for(i=0;i<v[nod].size();i++){
            vecin = v[nod][i];
            if(!mark[vecin]){
                mark[vecin] = mark[nod] + 1;
                Q.push(vecin);
            }
        }
    }
}


int main()
{
fin>>n>>m>>s;
for(i=1;i<=m;i++){
    fin>>a>>b;
    v[a].push_back(b);
}
BFS(s);
for(i=1;i<=n;i++){
    fout << mark[i] - 1 << " ";
}
    return 0;
}