#include <bits/stdc++.h>
#define INF 2000000000
using namespace std;

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

int n,m,s;
vector<int> L[100005];
int dp[100005];
queue<int> q;

void bfs()
{
    for(int i=1; i<=n; i++)
        dp[i]=INF;
    dp[s]=0;
    q.push(s);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto it: L[nod])
        {
            if(dp[it]>dp[nod]+1)
                dp[it]=dp[nod]+1, q.push(it);
        }
    }
}

int main()
{
    fin>>n>>m>>s;
    for(int i=1,x,y; i<=m; i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
    bfs();
    for(int i=1; i<=n; i++)
    {
        if(dp[i]==INF)
            fout<<"-1 ";
        else
            fout<<dp[i]<<" ";
    }
    return 0;
}