#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int Nmax = 100000 + 5;
#define pb push_back
int n, m, src, dp[Nmax];
vector <int> v[Nmax];
queue<int>q;

int main()
{
    fin >> n >> m >> src;

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

    for(int i = 1, a, b;i <= m; ++i)
    {
        fin >> a >> b;
        v[a].pb(b);
    }

    dp[src] = 0;
    q.push(src);

    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;
}