#include <iostream>
#include <fstream>
#include <queue>
#include <cstring>
#include <vector>
using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");
const int maxn = 100010;
int n,m,x,sol[maxn];
queue <int> Q;
vector <int> G[maxn];
int main()
{
    int i,a,b;
    in>>n>>m>>x;
    while(m--)
    {
        in>>a>>b;
        G[a].push_back(b);
    }
    memset(sol,-1,sizeof(sol));
    Q.push(x);
    sol[x]=0;
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        for(vector <int> :: iterator i = G[nod].begin();i!=G[nod].end();i++)
            if(sol[*i]==-1)
                {
                    sol[*i]=sol[nod]+1;
                    Q.push(*i);
                }
    }
    for(i=1;i<=n;i++)
        out<<sol[i]<<" ";
    return 0;
}