#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
#define MAX 100001
vector<int> lista[MAX];
queue<int> q;
int v[MAX], n, m, s;
void bfs(int nod);
int main()
{
    int i, x, y;
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &s);
    for(i=1; i<=m; i++){
        scanf("%d%d", &x, &y);
        lista[x].push_back(y);
    }
    bfs(s);
    for(i=1; i<=n; i++)
        printf("%d ", v[i]-1);
    return 0;
}
void bfs(int nod)
{
    int i;
    q.push(nod);
    v[nod] = 1;
    while(!q.empty()){
        nod = q.front();
        q.pop();
        for(i=0; i<lista[nod].size(); i++)
            if(v[lista[nod][i]]==0){
                v[lista[nod][i]] = v[nod]+1;
                q.push(lista[nod][i]);
            }
    }
}