#include <bits/stdc++.h>
#define cin fin
#define cout fout

using namespace std;

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

int vf[100001], v[100001], ans;
bool ok = false;
map <int, vector<int>> adj;
queue <int> nxt;
queue <int> nxt2;

class graph {
public:
    void addEdge(int x, int y) {
        adj[x].push_back(y);
    }
    void bfs(int st);
};

void graph::bfs(int st) {
    if(!nxt.empty())
        nxt.pop();
    vf[st] = 1;
    for(auto x : adj[st]) {
        if(!vf[x]) {
            nxt2.push(x);
            v[x] = ans+1;
        }
    }
    if(nxt.empty()) {
        ans++;
        swap(nxt, nxt2);
    }
    if(nxt.empty())
        return;
    bfs(nxt.front());
}

int main()
{
    int n, m, s, x, y;
    graph g;
    cin >> n >> m >> s;
    for(int i = 1; i <= m; i++) {
        cin >> x >> y;
        g.addEdge(x, y);
    }
    g.bfs(s);
    for(int i = 1; i <= n; i++) {
        if(i == s)
            cout << "0 ";
        else if(!v[i])
            cout << -1 << ' ';
        else
            cout << v[i] << ' ';
    }
    return 0;
}