#include <iostream>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
FILE *f,*g;
vector<int> veci[100001];
queue<int> bfs;
vector<int>::iterator it;
int dist[100001];
bool ok[100001];
int main()
{
    int n,m,s,i,x,y;
    f=fopen("bfs.in","r");
    g=fopen("bfs.out","w");
    fscanf(f,"%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
        {
            fscanf(f,"%d%d",&x,&y);
            veci[x].push_back(y);
        }
    bfs.push(s);ok[s]=1;
    while(!bfs.empty())
        {
            i=bfs.front();
            bfs.pop();
            it=veci[i].begin();
            while(it!=veci[i].end())
                {
                    if (!ok[*it]) {dist[*it]=dist[i]+1;ok[*it]=1;bfs.push(*it);}
                    it++;
                }

        }
    for(i=1;i<=n;i++)
        {
            if (dist[i]) fprintf(g,"%d ",dist[i]);
            else {if (i==s) fprintf(g,"0 "); else fprintf(g,"-1 ");}
        }




    return 0;
}