#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fi("bfs.in");
ofstream fo("bfs.out");
int n,m;
int X;
vector <int>V[100001];
queue <int>coada;
int viz[100001];
void BFS(int x)
{
    coada.push(x);
    viz[x]=1;
    while(!coada.empty())
    {
        int frontNode=coada.front();
        coada.pop();
        for(int i=0;i<V[frontNode].size();i++)
        {
            int vecin=V[frontNode][i];
            if(viz[vecin]==0)
            {
                coada.push(vecin);
                viz[vecin]=viz[frontNode]+1;
            }else
                viz[vecin]=min(viz[vecin],viz[frontNode]+1);
        }
    }
}
int main()
{
    fi>>n>>m>>X;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fi>>x>>y;
        if(x!=y)
            V[x].push_back(y);
    }
    BFS(X);
    for(int i=1;i<=n;i++)
        fo<<viz[i]-1<<" ";
    return 0;
}