#include <bits/stdc++.h>

using namespace std;
#define fi first
#define se second
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int NMAX = 1e5;
vector <int> g[NMAX + 5];
int d[NMAX + 5];

int main()
{
    int n, m, k, u, v;
    fin >> n >> m >> k;
    for(int i = 1; i <= n; i++) d[i] = -1;
    for(int i = 1; i <= m; i++)
        fin >> u >> v,
        g[u].push_back(v);
    queue <pair <int, int>> q;
    q.emplace(k, 0);
    while(!q.empty()) {
        auto top = q.front();
        q.pop();
        if(d[top.fi] > -1) continue;
        d[top.fi] = top.se;
        for(int v : g[top.fi])
            if(d[v] == -1)
                q.emplace(v, d[top.fi] + 1);
    }
    for(int i = 1; i <= n; i++)
        fout << d[i] << " ";
    return 0;
}