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

using namespace std;

vector <int>v[100010];
vector <int> w;
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)
{
    q.push(x);
    viz[x]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0; i<v[nod].size(); i++)
        {
            if(viz[v[nod][i]]==0 and v[nod][i])
            {
                q.push(v[nod][i]);
                viz[v[nod][i]]=1;
                w[v[nod][i]]=w[nod]+1;
            }
        }
    }
}
int main()
{
    fscanf(f,"%d%d%d",&n,&m,&k);
    for(int i=1; i<=n; i++)
        w.push_back(-1);
    w[k]=0;
    int x,y;
    for(int i=1; i<=m; i++)
    {
        fscanf(f,"%d%d",&x,&y);
        v[x].push_back(y);
    }
    bfs(k);
    for(int i=1; i<=w.size(); i++)
        printf("%d ",w[i]);
    return 0;
}