#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int nmax = 100001;
int n, m, s, x, y, i, j, lgdrum[nmax];
bool viz[nmax];
vector <int> graf[nmax];
void bfs(int nod)
{
    queue <int> coada;
    coada.push(nod);
    viz[nod]=1;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(i=1; i<=graf[nod][0]; i++)
            if(!viz[graf[nod][i]])
            {
                viz[graf[nod][i]]=1;
                lgdrum[graf[nod][i]]=lgdrum[nod]+1;
                coada.push(graf[nod][i]);
            }
    }
}
int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &s);
    for(i=1; i<=n; i++)
    {
        graf[i].push_back(0);
        lgdrum[i]=-1;
    }
    lgdrum[s]=0;
    for(i=1; i<=m; i++)
    {
        scanf("%d %d", &x, &y);
        graf[x][0]++;
        graf[x].push_back(y);
    }
    bfs(s);
    for(i=1; i<=n; i++)
        printf("%d ", lgdrum[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}