#include <bits/stdc++.h>

using namespace std;

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

const int nMax = 100005;
const int INF = 2000000000;
int n, m, S;
int dp[nMax];
vector <int> L[nMax];
queue <int> q;

inline void Read()
{
    int x, y;
    fin >> n >> m >> S;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
}

inline void BFS(int nod)
{
    for(int i = 1; i <= n; i++)
        dp[i] = INF;
    dp[S] = 0;
    q.push(S);
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        for(auto it : L[nod])
            if(dp[it] > dp[nod] + 1)
            {
                dp[it] = dp[nod] + 1;
                q.push(it);
            }
    }
    for(int i = 1; i <= n; i++)
        if(dp[i] == INF)    fout << "-1 ";
        else fout << dp[i] << " ";
}


int main()
{
    Read();
    BFS(S);
    return 0;
}