#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

queue<int> q;
vector<int> v[100001];
bool viz[100001];
int n, m, x, i, j;

int bfs(int start, int fin){
    if(start == fin)
        return 0;
    bool ok = 1;
    int k, d=0;
    q.push(start);
    viz[start] = 1;
    while (!q.empty() && ok){
        ++d;
        k = q.front();
        for(auto j: v[k]) {
            if(j == fin)
                ok = 0;
            if (viz[j] == 0) {
                viz[j] = 1;
                q.push(j);
            }
        }
        q.pop();
    }
    if (ok)
        return -1;
    return d;
}

int main(){
    in >> n >> m >> x;
    while(m--){
        in >> i >> j;
        v[i].push_back(j);
    }

    for(int i = 1; i<=n; i++)
        out << bfs(x, i) << ' ';
    return 0;
}