#include <bits/stdc++.h>
using namespace std;

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int s,n,m;
int v[100001];
vector <int> g[100002];
void bfs(int s){
    list<int> q;
    q.push_back(s);
    int x;
    v[s] = 0;
    while(!q.empty()){
        x = q.front();
        q.pop_front();
        for(int i = 0; i< g[x].size(); i++){
            if(v[ g[x][i] ] == -1){
                q.push_back(g[x][i]);
                v[ g[x][i] ] = v[x] + 1;
            }
        }
    }


}

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