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

using namespace std;

int n, m, s;

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

vector <int> vecini[100005]; bool viz[100005]; int dist[100005];

queue <pair <int,int> > q;
void BFS() {
    int i;
    while (!q.empty()) {
        int nod = q.front().first;
        int nr = vecini[nod].size();
        int cost = q.front().second;
        viz[nod] = 1;
        for(i = 0; i < nr; ++i) {
            if(!viz[vecini[nod][i]]) {
                dist[vecini[nod][i]] = cost + 1;
                q.push(make_pair(vecini[nod][i],cost+1));

            }
        }
        q.pop();
    }
}
int main() {
    int i,x,y;
    f>>n>>m>>s;
    for(i = 1; i <= m; ++i) {
        f>>x>>y;
        vecini[x].push_back(y);
    }
    viz[s] = 1;
    dist[s] = 0;
    q.push(make_pair(s,0));
    BFS();
    for(i = 1; i <= n; ++i) {
        if(viz[i]) {
            g<<dist[i]<<' ';
        }
        else g<<-1<<' ';
    }
    return 0;
}