#include <iostream>
#include <fstream>
#include <string.h>
#include <vector>
#include <queue>

#define NMax 100001

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int N,M,S;
vector<int> V[NMax];
int dist[NMax];
queue<int> Q;

void Read()
{
    fin>>N>>M>>S;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        fin>>x>>y;
        V[x].push_back(y);
    }
    memset(dist,-1,sizeof(dist));

}
void Write()
{
    for(int i=1;i<=N;i++)
        fout<<dist[i]<<" ";
}

void BFS()
{
    Q.push(S); dist[S]=0;
    while(!Q.empty())
    {
        int k=Q.front();
        Q.pop();
        for(int i=0;i<V[k].size();i++)
            if(dist[V[k][i]]==-1)
            {
                dist[V[k][i]]=dist[k]+1;
                Q.push(V[k][i]);
            }
    }
}

int main()
{
    Read();
    BFS();
    Write();
    return 0;
}