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

using namespace std;

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

queue <int> q;
vector <int> v[100005];
int d[100005];

int main()
{
    int n, m, s, x, y;
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        d[i] = -1;
    d[s] = 0;
    q.push(s);
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        for (int i = 0; i < v[x].size(); i++)
            if (d[v[x][i]] == -1)
            {
                d[v[x][i]] = d[x] + 1;
                q.push(v[x][i]);
            }
    }
    for (int i = 1; i <= n; i++)
        fout << d[i] << ' ';
    fout << '\n';
    return 0;
}