#include<fstream>
#include <bits/stdc++.h>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> v[100005];
queue  <int> q;
int n, m, s, dist[100005];

void bfs()
{
    int i, nod;
    while(!q.empty()){
        nod = q.front();
        q.pop();

        for(i=0; i<v[nod].size(); i++){
            if(dist[v[nod][i]] == -1){
                q.push(v[nod][i]);
                dist[v[nod][i]] = dist[nod]+1;
            }
        }
    }
}

int main(){
    f>>n>>m>>s;
    int a, b, i;

    for(i=1; i<m; i++){
        f>>a>>b;
        v[a].push_back(b);
    }

    for(i=1; i<=n; i++)
        dist[i] = -1;
 
    dist[s] = 0;
 
    q.push(s);
    bfs();
 
    for(i=1; i<=n; i++)
        g<<dist[i]<<" ";

    return 0;
}