#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int viz[100005],coada[100005],dist[100005];
vector<int>graph[100005];
void BFS(int nod)
{
    coada[1]=nod;
    viz[nod]=1;
    dist[nod]=0;
    int left=1;
    int right=1;
    while(left<=right)
    {
        int index=coada[left];
        int lim=graph[index].size();
        for(int i=0;i<lim;i++)
        {
            int vecin=graph[index][i];
            if(!viz[vecin])
            {
                coada[++right]=vecin;
                dist[vecin]=dist[index]+1;
                viz[vecin]=1;
            }
        }
    left++;
    }
}
int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");

    int n,m,i,a,b,prim;
    in>>n>>m>>prim;
    for(i=1;i<=m;i++)
    {
        in>>a>>b;
        graph[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        dist[i]=-1;

    BFS(prim);

    for(i=1;i<=n;i++)
        out<<dist[i]<<" ";
    return 0;
}