#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,i,nr[100010],x,y,nod;
vector <int> v[100010];
queue <int> q;
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        nr[i]=1000010;
    nr[s]=0;
    q.push(s);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(auto it:v[nod])
            if(nr[it]>nr[nod]+1)
            {
                nr[it]=nr[nod]+1;
                q.push(it);
            }
    }
    for(i=1;i<=n;i++)
        if(nr[i]!=1000010)
            fout<<nr[i]<<" ";
        else
            fout<<-1<<" ";
    return 0;
}