#include <bits/stdc++.h>
#include <unordered_map>
#define nmax 100005
#define MOD 666013
#define INF 2012345678
#define ll long long
using namespace std;

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

int n, m;
vector <int> L[nmax];
int viz[nmax];

void BFS(int k)
{
    queue <int> q;
    q.push(k);
    viz[k] = 1;
    while (!q.empty())
    {
        k = q.front();
        q.pop();
        for (int i : L[k])
            if (viz[i] == 0)
            {
                viz[i] = viz[k] + 1;
                q.push(i);
            }
    }
}

int main()
{
    int i, j, q, Start;
    fin >> n >> m >> Start;
    for (q = 1; q <= m; q++)
    {
        fin >> i >> j;
        L[i].push_back(j);
    }
    BFS(Start);
    for (i = 1; i <= n; i++)
        fout << viz[i] - 1 << " ";
    fin.close();
    fout.close();
    return 0;
}