#include <bits/stdc++.h>
#define N 100004
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n , m , s , d[N] , viz[N];
vector <int> L[N];
queue <int> q;
void Citire()
{
    int i , x , y;
    fin >> n >> m >> s;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);///orientat
    }
    fin.close();
}
void Bfs(int nod)
{
    int x;
    for(int i = 1; i <= n; i++)
        d[i] = -1;
    viz[nod] = 1;
    q.push(nod);
    d[nod] = 0;
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(auto j : L[x])
            if(viz[j] == 0)
            {
                viz[j] = 1;
                q.push(j);
                d[j] = d[x] + 1;
            }
    }
    for(int i = 1; i <= n; i++)
        fout << d[i] << " ";
}
int main()
{
    Citire();
    Bfs(s);
    fout.close();
    return 0;
}