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

using namespace std;

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

vector<int> la[100000];
int n, m, s;
int dist[100000];
int vis[100000];

void bfs(int s)
{
    queue<int> q;
    q.push(s);
    vis[s] = 1;

    while (!q.empty())
    {
        for (auto& el: la[q.front()])
        {
            if (!vis[el])
            {
                q.push(el);
                vis[el] = 1;
                dist[el] = dist[q.front()] + 1;
            }
        }
        q.pop();
    }
}

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

    for (int i = 0; i < m; i++)
    {
        int n1, n2;
        in >> n1 >> n2;
        la[n1-1].push_back(n2-1);
    }

    bfs(s-1);

    for (int i = 0; i < n; i++)
    {
        if (i != s-1 && dist[i] == 0)
            dist[i] = -1;
        out << dist[i] << ' ';
    }

    return 0;
}