#include <bits/stdc++.h>
using namespace std;

const int NMAX = 100010;
vector <int> vecini[NMAX];
int tata[NMAX];
bool vizitat[NMAX];
int dist[NMAX];

int main() 
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");

    int n, m, s;
    in >> n >> m >> s;

    for(int i = 0; i < m; i++) {
        int a, b;
        in >> a >> b;
        vecini[a].push_back(b);
    }

    tata[s] = -1;
    dist[s] = 0;
    vizitat[s] = 1;

    queue <int> q;
    q.push(s);

    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (int i = 0; i < (int)vecini[nod].size(); i++) {
            int fiu = vecini[nod][i];
            if (vizitat[fiu] == 0) {
                tata[fiu] = nod;
                q.push(fiu);
                vizitat[fiu] = 1;
                dist[fiu] = dist[nod] + 1;
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        if (vizitat[i] == 0)
            out << -1 << " ";
        else 
            out << dist[i] << " ";
    }
    out << '\n';
    return 0;
}