#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define nmax 100005
using namespace std;

int n,m1,s;
int d[nmax];
vector<int> m[nmax];
queue<int> q;

inline void bfs(int surs)
{
    int nod;
    vector<int>::iterator it;
    q.push(surs);
    d[surs]=0;
    while(!q.empty())
    {
        nod=q.front(); q.pop();
        for(it=m[nod].begin();it!=m[nod].end();it++)
            if(!d[*it] && *it!=surs)
            {
                d[*it]=d[nod]+1;
                q.push(*it);
            }
    }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int i;
    scanf("%d%d%d",&n,&m1,&s);
    int n1,n2;
    for(;m1;m1--)
    {
        scanf("%d%d",&n1,&n2);
        m[n1].push_back(n2);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        if(d[i]==0 && i!=s) printf("-1 ");
                    else printf("%d ",d[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}