#include <fstream>
#include <queue>

using namespace std;

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

int n, m, s;

vector<int> g[100001];

int viz[100001];
void bfs(int nod) {
    queue<int> q;
    q.push(nod);
    viz[nod] = 1;
    while (!q.empty()) {
        for (auto i : g[q.front()])
            if (!viz[i]) {
                viz[i] = viz[q.front()] + 1;
                q.push(i);
            }
        q.pop();
    }
}

int main() {
    cin >> n >> m >> s;
    for (int i = 1; i <= m; ++i) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
    }
    
    bfs(s);

    for (int i = 1; i <= n; ++i)
        cout << viz[i] - 1 << ' ';

    return 0;
}