#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
const int N=100007;
vector <int> a[N];
int poz[100000],x=0,n;
queue <int> v;
void lee()
{
    int u;
    while(!v.empty())
    {
        u=v.front();
        v.pop();
        for(int i=0;i<a[u].size();i++)
        {
            if(poz[a[u][i]]==-1)
            {
                v.push(a[u][i]);
                poz[a[u][i]]=poz[u]+1;
            }
        }
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int m,s;
    scanf("%d%d%d",&n,&m,&s);
    int x,y;
    while(m--)
    {
        scanf("%d%d",&x,&y);
        if(x!=y)
            a[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        poz[i]=-1;
    poz[s]=0;
    x++;
    v.push(s);
    lee();
    for(int i=1;i<=n;i++)
        printf("%d ",poz[i]);
    return 0;
}