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

using namespace std;

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

int D[100001];
bool v[100001];
vector<int> A[100001];
int n, m, s;

void bfs(int n)
{
    queue<pair<int, int>> q;
    q.push({n, 0});
    v[n] = true;

    while(!q.empty())
    {
        auto [x, d] = q.front();
        D[x] = d;
        q.pop();

        for(const auto& y : A[x])
            if(!v[y])
            {
                v[y] = true;
                q.push({y, d + 1});
            }
    }
}

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

    bfs(s);

    for(int i = 1; i <= n; i++)
        fout << (D[i] == 0 ? (i != s ? -1 : 0) : D[i]) << ' ';

    fin.close();
    fout.close();

    return 0;
}