#include <bits/stdc++.h>
using namespace std;
#define Nmax 100005

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

vector<int> v[Nmax];
queue<int> q;
int dp[Nmax];
int n, m, s;

int main()
{
    fin >> n >> m >> s;
    for (int i = 0, x, y; i < m; ++i)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }

    for (int i = 1; i <= n; ++i)
        dp[i] = (1 << 30);

    dp[s] = 0;

    q.push(s);
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();

        for (auto i : v[nod])
            if (dp[i] > dp[nod] + 1)
            {
                dp[i] = dp[nod] + 1;
                q.push(i);
            }
    }

    for (int i = 1; i <= n; ++i)
    {
        if (dp[i] == (1 << 30))
            dp[i] = -1;
        fout << dp[i] << ' ';
    }

    return 0;
}