#include <fstream>
#include <iostream>
#include <vector>
#include <deque>

#define MAXN 100010


using namespace std;

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

int N, M, root;
int x, y;
vector<int> L[MAXN];
deque<int> q;
int d[MAXN];

int main()
{
    fin >> N >> M >> root;
    for (int i = 1; i <= M; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }

    q.push_back(root);
    d[root] = 1;
    
    while(!q.empty())
    {
        int node = q.front();
        for (const auto nextNode : L[node])
        {
            if (d[nextNode] == 0)
            {
                q.push_back(nextNode);
                d[nextNode] = d[node] + 1;
            }
        }
        q.pop_front();
    }

    for (int i = 1; i <= N; i++)
    {
        fout << d[i] - 1 <<  " ";
    }
    return 0;
}