#include <bits/stdc++.h>

using namespace std;

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

vector<int> a[100001];
int d[100001];

void bfs(int x)
{
    queue<int> q;
    q.push(x);
    d[x] = 0;
    while(!q.empty())
    {
        int vf = q.front();
        int k = a[vf].size();
        for(int i = 0; i < k; i++)
        {
            if(d[a[vf][i]] == -1)
            {
                d[a[vf][i]] = d[vf] + 1;
                q.push(a[vf][i]);
            }
        }
        q.pop();
    }
}

int main()
{
    int N, M, S;
    in >> N >> M >> S;
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        in >> x >> y;
        a[x].push_back(y);
    }
    for(int i = 1; i <= N; i++)
    {
        d[i] = -1;
    }
    bfs(S);
    for(int i = 1; i <= N; i++)
    {
        out << d[i] << " ";
    }
    return 0;
}