#include <fstream>
#include <queue>
#include <set>
#include <vector>
#include <cstring>

using namespace std;

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

const int N_MAX = 100005;
const int INF = 0x3f3f3f3f;

vector<int> AD[N_MAX];
int dist[N_MAX];

int main()
{
    int n, m, s;

    fin >> n >> m >> s;

    for (int i=1; i <= m; i++)
    {
        int from, to;
        fin >> from >> to;
        if (from != to)
            AD[from].push_back(to);
    }

    /*

    for (int i=1; i<=n; i++) {
        cout << " node " << i << " is adiacent to ";
        for (vector<int>::iterator it = AD[i].begin(); it != AD[i].end(); it++) {
            cout << *it << ' ';
        }
        cout << '\n';
    }

    */
    queue<int> coada;
    set<int> checked;
    memset(dist, INF, sizeof(dist));
    dist[s]= 0;

    coada.push(s);
    checked.insert(s);

    while (!coada.empty())
    {
        int current = coada.front();
        coada.pop();
        {
            for (vector<int>::iterator it = AD[current].begin(); it != AD[current].end(); it++)
            {
                int node = *it;
                if (checked.find(node) == checked.end())
                {
                    checked.insert(node);
                    coada.push(node);
                    if (dist[node] > dist[current] + 1) dist[node] = dist[current] + 1;
                }
            }

        }
    }
    for (int i=1; i <= n; i++)
    {
        if (dist[i] == INF) dist[i]=-1;
        fout << dist[i] << ' ';
    }
    return 0;
}