#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, t[100005], p, m;
vector < int > v[100005];
queue < int > coada;

void bfs()
{
    coada.push(p);
    while(!coada.empty())
    {
        int nod = coada.front();
        coada.pop();
        for(int i = 0; i < v[nod].size(); i++)
            if(t[v[nod][i]] == -1)
            {
                t[v[nod][i]] = t[nod] + 1;
                coada.push(v[nod][i]);
            }
    }
}

int main()
{
    fin >> n >> m >> p;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        t[i] = -1;
    t[p] = 0;
    bfs();
    for(int i = 1; i <= n; i++)
        fout << t[i] << ' ';
}