#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int N, M, Start, X, Y;
queue<int> Q;

void BFS(int s, int nr_noduri, vector<vector<int> > L, vector<int> &viz)
{
    Q.push(s); viz[s] = 0;
    while(!Q.empty())
    {
        int curent = Q.front(); Q.pop();
        for(int y : L[curent])
        {
            if(viz[y] < 0)
            {
                viz[y] = viz[curent] + 1;
                Q.push(y);
            }
        }
    }

}

int main()
{
    fin>>N>>M>>Start;
    vector<vector<int> > L(M+1);
    for(int i = 0; i < M; i++)
    {
        fin>>X>>Y;
        L[X].push_back(Y);
    }
    fin.close();

    vector<int> viz(N+1, -1);
    for(int i = 1; i <=N; i++)
    {
        BFS(Start, N, L, viz);
        fout<<viz[i]<<' ';
    }
    fout.close();
    return 0;
}