#include<vector>
#include<string.h>
#include<cstdio>
using namespace std;
#define nmax 100001
vector <int> v[nmax];
int n,m,s,a[nmax],cost[nmax],b[nmax];
bool use[nmax];
void bfs()
{
    int i,j,l=1,k=1;
    for(i=0;i<l;i++)
    {
        for(j=0;j<v[a[i]].size();j++)
        {
            int nod=v[a[i]][j];
            if(cost[nod]<1 && !use[nod])
            {
                use[nod]=1;
                b[l]=b[i]+1;
                cost[nod]=b[l];
                a[l++]=nod;
            }
        }
    }
}
int main()
{
    int x,y,i;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d",&n,&m,&s);
    a[0]=s;
    use[s]=1;
    for(i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        v[x].push_back(y);
    }
    memset(cost,-1,nmax);
    bfs();
    cost[s]=0;
    for(i=1;i<=n;i++)
        printf("%d ",cost[i]);
    return 0;
}