#include <bits/stdc++.h>

using namespace std;

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

vector <vector <int> > v;
int d[100010] = {-1};
int viz[100010] = {0};

int main()
{
    int n, m, s;
    f >> n >> m >> s;
    v.resize(n + 1);
    for(int i = 1; i <= n; i++) {
        d[i] = -1;
    }
    for(int i = 0; i < m; i++) {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
    }
    queue <int> q;
    q.push(s);
    d[s] = 0;
    while(!q.empty()) {
        int x = q.front();
        q.pop();
        viz[x] = 1;
        for(int i = 0; i < v[x].size(); i++) {
            if(viz[v[x][i]] == 0) {
                viz[v[x][i]] = 1;
                d[v[x][i]] = d[x] + 1;
                q.push(v[x][i]);
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        g << d[i] << " ";
    }
    return 0;
}