#include <bits/stdc++.h>

using namespace std;
vector <int> v[100001];
queue <int> q;
int d[100001];
int main()
{
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int n, m, k;
    cin >> n >> m >> k;
    for( int i = 1; i <= m; i ++ )
    {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
    }
    for ( int i = 1; i <= n; i++ )
    {
        d[i] = INT_MAX;
    }
    d[k] = 0;
    q.push(k);
    while(!q.empty())
    {
        int aux = q.front();
        for ( auto x:v[aux])
        {
            if (d[x] == INT_MAX)
            {
                d[x] = d[aux] + 1;
                q.push(x);
            }
        }
        q.pop();
    }
    for ( int i = 1; i <= n; i++)
    {
        if(d[i] != INT_MAX)
            cout << d[i] << " ";
        else
            cout << -1 << " ";
    }
    return 0;
}