#include <iostream>
#include <fstream>
#include <queue>

#define max 10005
using namespace std;
queue <int> q;
int a[max][max];
int viz[max];
int n,m,s;
void citire()
{
    scanf("%d %d %d",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        if(x!=y)
            a[x][y]=1;
    }
}
void bfs()
{
    int aux;
    q.push(s);
    while(!q.empty())
    {
        aux=q.front();
        q.pop();
            for(int i=1;i<=n;i++)
                if(a[aux][i]==1 && viz[i]==0)
                    q.push(i),viz[i]=viz[aux]+1;
    }
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            viz[i]=-1;
    viz[s]=0;
    for(int i=1;i<=n;i++)
        cout<<viz[i]<<" ";
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    bfs();
    return 0;
}