#include <bits/stdc++.h>
#define MAXN 100001
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n,m,s,dist[MAXN],d=0;
vector<int> v[MAXN];
queue<int> q;
int main()
{
    in>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
        int x,y;
        in>>x>>y;
        v[x].push_back(y);
    }
    memset(dist,-1,sizeof(dist));
    q.push(s);
    dist[s]=0;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i: v[nod])
            if(dist[i]==-1)
            {
                dist[i]=dist[nod]+1;
                q.push(i);
            }
    }
    for(int i=1;i<=n;++i)
        out<<dist[i]<<' ';
    return 0;
}