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

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

vector < int > g[MAX];
int n, m, x, y, s, dist[MAX];
bitset < MAX > c;
queue < int > q;

void bfs(int k){
    q.push(k);
    c[k] = true;
    while(!q.empty()){
        k = q.front();
        c[k] = true;
        q.pop();
        for(int i = 0; i < g[k].size(); i++)
            if(!c[g[k][i]])
               q.push(g[k][i]), dist[g[k][i]] = dist[k] + 1;
    }
}

int main(){
    in>>n>>m>>s;
    for(int i = 1; i <= m; i++){
        in>>x>>y;
        g[x].push_back(y);
    }
    bfs(s);
    for(int i = 1; i <= n; i++)
        out<<(dist[i] == 0 && i != s ? -1 : dist[i])<<" ";
}