#include <bits/stdc++.h>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

const int N = 1e5 + 5;
int n, m, a, b, x, d[N];
vector<int>G[N];
bitset<N>viz;
queue<int>q;

void bfs(int start)
{
    for(int i = 1; i <= n; i++)
        d[i] = INT_MAX;

    d[start] = 0;

    viz[start] = 1;

    q.push(start);

    while(!q.empty())
    {
        int nod = q.front();

        vector<int>::iterator it;
        for(it = G[nod].begin(); it < G[nod].end(); it++)
            if(viz[*it] == 0)
            {
                q.push(*it);
                d[*it] = d[nod] + 1;
                viz[*it] = 1;
            }

        q.pop();
    }
}

int main()
{
    in >> n >> m >> x;

    while(m--)
    {
        in >> a >> b;
        G[a].push_back(b);
    }

    bfs(x);

    for(int i = 1; i <= n; i++)
        if(d[i] != INT_MAX) out << d[i] << " ";
        else out << "-1 ";

    return 0;
}