#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;


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


const int INF=-1;
int n,m,s;
vector <int> L[100005];
int dp[100005];
queue <int> Q;


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


void BFS(int nod)
{
    for(int i=1; i<=n; i++)
    {
        dp[i]=INF;
    }
    Q.push(nod);
    dp[nod]=0;
    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        for(auto vecin : L[nod])
        {
            if(dp[vecin]==INF)
            {
                dp[vecin]=dp[nod]+1;
                Q.push(vecin);
            }
        }
    }
}


int main()
{
    read();
    BFS(s);
    for(int i=1;i<=n;i++)
    {
        fout<<dp[i]<<" ";
    }
    return 0;
}