#include <bits/stdc++.h>
#define MAX 9999999
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> v[100005];
queue <int> q;
int viz[100005], dp[100005];
int n, m, s;
void Citire()
{
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i ++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
    for(int i = 1; i <= 100000; i ++)
        dp[i] = MAX;

    dp[s] = 0;
}

void BFS(int start)
{
    q.push(start);
    while(!q.empty())
    {
        int aux = q.front();
        q.pop();
        for(auto it: v[aux])
        {
            viz[it] = 1;
            if(dp[it] > dp[aux] + 1)
            {
                dp[it] = dp[aux] + 1;
                q.push(it);
            }
        }
    }
}
int main()
{
    Citire();
    BFS(s);
    for(int i = 1; i <= n; i ++)
    {
        if(dp[i] == MAX)
            fout << -1;
        else
            fout << dp[i];
        fout << " ";
    }
    return 0;
}