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

using namespace std;

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

const int NMAX = 100000;
vector <int> g[NMAX + 1];
queue <int> q;
int d[NMAX + 1];
bool viz[NMAX + 1];

int main()
{
    int n, m, s;
    in >> n >> m >> s;
    ///citire
    for (int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;
        g[x].push_back(y);
    }
    ///bfs
    q.push(s);
    viz[s] = true;
    while (!q.empty())
    {
        int x = q.front();
        ///out << "la nodul: " << x << " avem vecinii: \n";
        for (int y: g[x])
        {
            ///out << y;
            if (!viz[y])
            {
                viz[y] = true;
                d[y] = d[x] + 1;
                q.push(y);
                ///out << " la distanta " << d[y] << " de s";
            }
            ///out << "\n";
        }
        q.pop();
    }
    ///afisare
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            out << -1 << " ";
        }
        else
        {
            out << d[i] << " ";
        }
    }
    return 0;
}