#include <fstream>
#include <queue>
#include <list>
#define ll long long
using namespace std;

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

const int maxN = 100003;
list <int> a[maxN];
int ok[maxN];
int main()
{
    int n, m, s;
    cin >> n >> m >> s;
    while (m--)
    {
        int x, y;
        cin >> x >> y;
        if (x == y)
            continue;
        a[x].push_back(y);
    }
    queue <int> q;
    q.push(s);
    while (!q.empty())
    {
        int v = q.front();
        q.pop();
        for (int it : a[v])
            if (!ok[it])
            {
                ok[it] = ok[v] + 1;
                q.push(it);
            }
    }
    for (int i = 1; i <= n; i++)
    {
        if (!ok[i])
            ok[i] = -1;
        if (i == s)
            ok[i] = 0;
        cout << ok[i] << " ";
    }
}