#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

vector <int>v[100010];
queue <int > q;

int n,m,k,viz[100010];

FILE* f=fopen("bfs.in","r");
FILE* g=fopen("bfs.out","w");

void bfs(int x)
{
    while(!q.empty())
    {
        int nod=q.front();
        for(int i=0; i<v[nod].size(); i++)
        {
            if(viz[v[nod][i]]==0)
            {
                q.push(v[nod][i]);
                viz[v[nod][i]]=viz[nod]+1;
            }
        }

        q.pop();
    }
}
int main()
{
    fscanf(f,"%d%d%d",&n,&m,&k);

    viz[k]=0;
    int x,y;
    for(int i=1; i<=m; i++)
    {
        fscanf(f,"%d%d",&x,&y);
        v[x].push_back(y);
        if(x==k)
            q.push(y),viz[y]=1;
    }
    bfs(k);
    for(int i=1; i<=n; i++)
        if(viz[i]!=0 and i!=k)
            fprintf(g,"%d ",viz[i]);
        else if (i==k)
            fprintf(g,"%d ",0);
        else fprintf(g,"%d ",-1);


    return 0;
}