#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector < int > muchii[100001];
queue < int > coada;
int distanta[100001];
void BFS () {
    int nod, vecin;
    while(coada.size() > 0) {
        nod = coada.front();
        coada.pop();
        for(int i = 0; i < muchii[nod].size(); ++i) {
            vecin = muchii[nod][i];
            if(distanta[vecin] == -1){
                coada.push(vecin);
                distanta[vecin] = distanta[nod] + 1;
            }
        }
    }
}


int main() {
   int n, m, nodStart;
   fin >> n >> m >> nodStart;
   for (int i = 1; i <= m; ++i) {
        int x, y;
        fin >> x >> y;
        muchii[x].push_back(y);
   }

   for(int i = 1; i <= n; ++i) {
    distanta[i] = -1;
   }
   distanta[nodStart] = 0;
   coada.push(nodStart);
   BFS();
   for(int i = 1; i <= n; ++i) {
    fout << distanta[i] << " ";
   }

    return 0;
}