#include <bits/stdc++.h>
#define N 100005
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;
vector<int>a[N];
int viz[N];


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

}

void BFS(int x)
{
    queue<int>C;

    int i,v;
    viz[x]=1;
    C.push(x);
    while(!C.empty())
    {
        v=C.front();
        C.pop();
        for(i=0; i<a[v].size(); i++)
            if(viz[a[v][i]]==0)
            {
                viz[a[v][i]]=viz[v]+1;
                C.push(a[v][i]);
            }
    }

}


int main()
{
    Citire();
    BFS(s);
    int i;
    for(i=1; i<=n; i++)
        if(viz[i]==0)fout<<-1<<" ";
        else fout<<viz[i]-1<<" ";

    return 0;
}