#include <fstream>
#include <vector>
#include <queue>
using namespace std;

const int MAXN = 100010;
const int INF = 0x3f3f3f3f;

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

int n, m, s, d[MAXN];
vector <int> g[MAXN];
queue <int> q;

void bfs()
{
    for (int i = 1; i <= n; ++i)
        d[i] = INF;
    d[s] = 0;
    q.push(s);
    while (!q.empty())
    {
        int node = q.front();
        q.pop();
        for (vector <int> :: iterator it = g[node].begin(); it != g[node].end(); ++it)
        {
            int v = *it;
            if (d[v] > d[node] + 1)
            {
                d[v] = d[node] + 1;
                q.push(v);
            }
        }
    }
    for (int i = 1; i <= n; ++i)
    {
        if (d[i] != INF)
            fout << d[i] << " ";
        else
            fout << -1 << " ";
    }
}

int main()
{
    fin >> n >> m >> s;
    for (int a, b; m; --m)
    {
        fin >> a >> b;
        g[a].push_back(b);
    }
    bfs();
    return 0;
}