#include<bits/stdc++.h>
using namespace std;
#define in f
#define out g

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

queue <int> q;
int n;
int depth[1000000];
int s;
int viz[100000];
int node;
int adj;
int m;
int M[20000][20000];
int x[10000000];
int y[10000000];

int main() {

    in >> n;
    in >> m;
    in >> s;
    for(int i = 1; i <= m; i++) {
        in >> x[i];
        in >> y[i];
    }
    for(int i = 1; i <= m + n; i++) {
        viz[i] = 0;
        for(int j = 1; j <= m + n; j++) {
            M[x[j]][y[j]] = 1;
        }
    }
    q.push(s);
    viz[s] = 1;
    while(q.empty() == false) {
        node = q.front();
        q.pop();
        for(int i = 1; i <= n; i++) {
            adj = i;
            if((viz[adj] == 0)&&(M[node][i] == 1)) {
                q.push(adj);
                depth[adj] = depth[node] + 1;
                viz[adj]++;
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        if(viz[i] == 0) {
            out << "-1 ";
        } else {
            out << depth[i] << " ";
        }
    }
}