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

const int NMAX = 1e5 + 5;
const char nl = '\n';
vector<int> g[NMAX];
int dist[NMAX];

void bfs (int source) {
    dist[source] = 0;
    queue<int> q;
    q.push(source);
    while (!q.empty()) {
        int curr_node = q.front();
        q.pop();
        for (auto neigh: g[curr_node]) {
           if (dist[neigh] == -1) {
                dist[neigh] = dist[curr_node] + 1;
                q.push(neigh);
           }
        }
    }


    
}



int main () {
    int n, m, s;
    fin >> n >> m >> s;
    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
    }
    for (int i = 1; i <= n; i++) 
        dist[i] = -1;
    bfs(s);
    for (int i = 1; i <= n; i++) {
        fout << dist[i] << " ";
    }
}