#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#define NMAX 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, st ,lg[100005];
vector <int > graph[NMAX];
queue <pair < int ,int > > q;
void citire()
{
    fin >> n >> m >> st;

    for(int i = 1; i <= n; i++)
        lg[i] = -1;
    for(int i = 0; i < m; i++)
    {
        int x,y;
        fin >> x >> y;
        graph[x].push_back(y);
    }
}

void bfs(){
    lg[st] = 0;
    q.push({st, 0});
    while(!q.empty()){
        int vf = q.front().first;
        int lc = q.front().second + 1;
        for(auto &v : graph[vf])
            if(lg[v] == -1){
                q.push({v, lc});
                lg[v] = lc;
            }
        q.pop();
    }
}
void afisare()
{
    for(int i = 1; i <= n; i++)
        fout <<lg[i] << " ";
}
int main()
{
   citire();
   bfs();
   afisare();
    return 0;
}