#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

const int NMAX = 1e5 + 5;

vector<int> g[NMAX];
int freq[NMAX];

void bfs(int src, int size) {
    queue<int> q;
    vector<int> dist(size + 1, -1);

    dist[src] = 0;
    q.push(src);

    while(!q.empty()) {
        int node = q.front();
        q.pop();

        for(auto neigh: g[node]) {
            if(dist[neigh] == -1) {
                dist[neigh] = dist[node] + 1;
                q.push(neigh);
            }
        }
    }

    for(int i = 1; i <= size; ++i) {
        cout << dist[i] << ' ';
    }
}

int main() {
    int n, m, source;
    cin >> n >> m >> source;

    for(int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
    }

    bfs(source, n);
    return 0;
}