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

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, k;
vector<int> gf[100001];
int viz[100001], tata[100001];

void BFS(int x) {
    queue<int> q;
    viz[x] = 1;
    q.push(x);
    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (int i : gf[nod])
            if (!viz[i]) {
                tata[i] = nod;
                viz[i] = 1;
                q.push(i);
            }
    }
}

int Count(int start) {
    int nr = 0, i;
    for (i = start; tata[i] != 0; i = tata[i])
        nr++;
    if (i != k)
        return -1;
    return nr;
}

int main()
{
    fin >> n >> m >> k;
    for (int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        gf[x].push_back(y);
    }
    BFS(k);
    for (int i = 1; i <= n; i++)
        fout << Count(i) << " ";
    return 0;
}