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