#include<cstdio>
#include<deque>
#include<vector>
#define nmax 100001
using namespace std;
deque<int> Q;
vector<int> v[nmax];
vector<int>::iterator it;
int n,m,i,s,viz[nmax],x,y,nod;
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d", &n, &m, &s);
    for(i=1;i<=n;i++)
        viz[i]=-1;
    for(;m;m--)
    {
        scanf("%d%d", &x, &y);
        v[x].push_back(y);
    }
    viz[s]=0;
    Q.push_back(s);
    while(Q.size())
    {
        nod=Q.front();
        for(it=v[nod].begin();it!=v[nod].end();it++)
            if(viz[*it]==-1)
            {
                viz[*it]=viz[nod]+1;
                Q.push_back(*it);
            }
        Q.pop_front();
    }
    for(i=1;i<=n;i++)
        printf("%d ", viz[i]);
    return 0;
}