#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int d[100001],q[100001];
vector <int> g[100001];
int main()
{
    ifstream fin ("bfs.in");
    ofstream fout ("bfs.out");
    int n,m,s,ic,sf,i,a,b,node;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        g[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        d[i]=-1;
    q[1]=s;
    d[s]=0;
    ic=sf=1;
    while(ic<=sf)
    {
        node=q[ic];
        a=g[node].size();
        for(i=0;i<a;i++)
        {
            if(d[g[node][i]]==-1)
            {
                d[g[node][i]]=d[node]+1;
                sf++;
                q[sf]=g[node][i];
            }
        }
        ic++;
    }
    for(i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}