#include <bits/stdc++.h>

using namespace std;

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

int n,m,s,i,x,y,cost[100005];
vector <int> t[100005];
queue <int> coada;


void bfs()
{
    int k,i;
    coada.push(s);
    cost[s]=1;
    while (!coada.empty())
    {
        k=coada.front();
        coada.pop();
        for (i=0; i<t[k].size(); i++)
        {
            if (cost[t[k][i]]==0)
            {
                cost[t[k][i]]=cost[k]+1;
                coada.push(t[k][i]);
            }
        }
    }
}

int main()
{
    fin>>n>>m>>s;
    for (i=1; i<=m; i++)
        {
            fin>>x>>y;
            t[x].push_back(y);
        }

    bfs();

    for (i=1; i<=n; i++)
        fout<<cost[i]-1<<" ";
    return 0;
}