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

using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n, m, s, v[100010];
vector <int> a[100010];
queue <int> nod;

void bfs () {
    v[s] = 1;
    while (!nod.empty()) {
        int nod_curent = nod.front();
        for (int l = 0; l < a[nod_curent].size(); l++) {
            if (!v[ a[nod_curent][l] ]) {
                v[ a[nod_curent][l] ] = v[nod_curent]+1;
                nod.push( a[nod_curent][l] );
            }
        }
        nod.pop();
    }
}

int main()
{
    int i, x, y;
    fin >> n >> m >> s;
    for (i = 1; i <= m; i++) {
        fin >> x >> y;
        a[x].push_back(y);
    }

    nod.push(s);
    bfs();
    for (i = 1; i <= n; i++)
        fout << v[i]-1 << " ";
    return 0;
}