#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s;
const int nmax = 100005;
int distanta[nmax];
vector < int > muchii[nmax];
queue < int > C;
void bfs()
{
    int nod, vecin;
    while(!C.empty())
    {
        nod = C.front();
        C.pop();
        for(int i = 0; i < muchii[nod].size(); ++i)
        {
            vecin = muchii[nod][i];
            if(distanta[vecin] == -1)
            {
                C.push(vecin);
                distanta[vecin] = distanta[nod] + 1;
            }
        }
    }
}
void read()
{
    fin >> n >> m >> s;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        muchii[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
        distanta[i] = -1;
    distanta[s] = 0;
    C.push(s);
    bfs();

    for(int i = 1; i <= n; ++i)
        fout << distanta[i] << " ";
}
int main()
{
    read();
    return 0;
}