#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, k, x, y, v[100001], cnt;
vector<int> g[100001];
queue<int> q;
void bfs(int start){
    q.push(start);
    v[start] = 0;
    while(!q.empty()){
        int nod = q.front();
        for(int i=0; i<g[nod].size(); i++){
            int dest = g[nod][i];
            if(v[dest] == -1){
                v[dest] = v[nod]+1;
                q.push(dest);
            }
        }
        q.pop();
    }
}
int main(){
    fin>>n>>m>>k;
    for(int i=1; i<=n; i++) v[i] = -1;
    for(int i=1; i<=m; i++){
        fin>>x>>y;
        g[x].push_back(y);
    }
    bfs(k);
    for(int i=1; i<=n; i++)
        fout<<v[i]<<" ";
    return 0;
}