#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e5;
vector <int> v[NMAX + 5];
queue <int> q;
bool f[NMAX + 5];
int ans[NMAX + 5];

int main()
{
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    int n,m,s,x,y;
    fin >> n >> m >> s;
    for (int i = 0;i < m;i++) {
        fin >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1;i <= n;i++)
        ans[i] = -1;
    q.push(s);
    ans[s] = 0;
    f[s] = 1;
    while (!q.empty()) {
        x = q.front();
        q.pop();
        for (int i = 0;i < v[x].size();i++) {
            if (!f[v[x][i]]) {
                ans[v[x][i]] = ans[x] + 1;
                f[v[x][i]] = 1;
                q.push(v[x][i]);
            }
        }
    }
    for (int i = 1;i <= n;i++)
        fout << ans[i] << " ";
    return 0;
}