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

using namespace std; 
vector<int> g[100001];
bool viz[100001];
int dist[100001];

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

void bfs(int nod) {
    queue<int> q;
    q.push(nod);
    dist[nod] = 0;
    viz[nod] = true;
    while(!q.empty()) {
        int x = q.front();
        q.pop();
        for(int exp : g[x]) {
            if(viz[exp]) continue;
            q.push(exp);
            viz[exp] = 1;
            dist[exp] = dist[x]+1;
        }
    }
}

int main() {
    int n, m, nod;
    in >> n >> m >> nod;
    int a, b;
    for(int i = 0; i < m; i++) {
        in >> a >> b;
        g[a].push_back(b);
    }
    bfs(nod);
    for(int i = 1; i <= n; i++) {
        if(viz[i]) out << dist[i] << " ";
        else out << "-1 ";
    }
    return 0;
}