#include <fstream>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");

vector<vector<int>> la;
queue<int> q;
vector<bool> visited;
vector<int> niv;
vector<int> tata;

void bfs(int s, int n) {

    visited[s] = true;
    niv[s] = 0;
    tata[s] = 0;
    q.push(s); 
    while(!q.empty()) {
        int curr = q.front();
        q.pop();
        for(int neighbour : la[curr]) {
            if(!visited[neighbour]) {
                q.push(neighbour);
                visited[neighbour] = true;
                niv[neighbour] = niv[curr] + 1;
                tata[neighbour] = curr;
            }
        }
    }

}

int getNiv(int s) {
    if(tata[s] == -1) return -1;
    int niv = 0;
    while(tata[s] != 0) {
        niv++;
        s = tata[s];
    }
    return niv;
}

int main() {
    int n, m, s, x, y;
    cin >> n >> m >> s;
    la.assign(n + 1, {});
    visited.assign(n + 1, 0);
    niv.assign(n + 1, -1);
    tata.assign(n + 1, -1);

    for(int i = 1; i <= m; i++) {
        cin >> x >> y;
        la[x].push_back(y);
    }

    bfs(s, n);

    for(int i = 1; i <= n; i++)
        // cout << niv[i] << ' ';
        cout << getNiv(i) << ' ';
    return 0;
}