#include <cstdio>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;

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

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int n, m, s, nod, nou, a, b;
    scanf("%d %d %d", &n, &m, &s);
    for (int i = 1; i <= m; ++i)
    {
        scanf("%d %d", &a, &b);
        g[a].push_back(b);
    }

    memset(d, -1, sizeof(d));
    q.push(s); viz[s] = 1;  d[s] = 0;

    while (!q.empty())
    {
        nod = q.front();
        for (int i = 0; i < g[nod].size(); ++i)
        {
            nou = g[nod][i];
            if (viz[nou] == 0)
            {
                viz[nou] = 1;
                d[nou] = d[nod] + 1;
                q.push(nou);
            }
        }
        q.pop();
    }
    for (int i = 1; i <= n; ++i)
        printf("%d ", d[i]);
    return 0;
}