#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int NMAX = 100001;

int n, m, startVertex;
vector<int> AdjList[NMAX];
vector<int> viz(NMAX, 0);

void citire()
{
    fin >> n >> m >> startVertex;
    for(int i = 1 ; i <= m ; i++)
    {
        int a,b;
        fin >> a >> b;
        AdjList[a].push_back(b);
    }
}

void bfs(int start)
{
    queue<int> Q;
    Q.push(start);
    viz[start] = 1;

    while(!Q.empty())
    {
        int nod_crt = Q.front();
        Q.pop();

        for(int i = 0; i < AdjList[nod_crt].size(); i++)
            if(viz[AdjList[nod_crt][i]] == 0)
            {
                Q.push(AdjList[nod_crt][i]);
                viz[AdjList[nod_crt][i]] += viz[nod_crt] + 1;
            }
    }
}

int main()
{
    citire();
    bfs(startVertex);
    for(int i = 1 ; i <= n ; i++)
        fout << viz[i] - 1 << ' ';
}