#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>

using namespace std;

int n, m, s, p[100005];

vector <int>g[100005];
queue <int>q;

void citire(){
    int x, y;
    cin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        cin >> x >> y;
        g[x].push_back(y);
    }
}

void init(){
    for(int i = 1; i <= n; i++)
        p[i] = -1;
}

void parcurgere(){
    int nod = q.front();
    for(auto &a:g[nod])
        if(p[a] == -1){
            p[a] = p[nod]+1;
            q.push(a);
        }
    q.pop();
}

void afisare(){
    for(int i = 1; i <= n; i++)
        cout << p[i] << ' ';
}

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    citire();
    init();

    q.push(s);
    p[s] = 0;
    while(!q.empty())
        parcurgere();

    afisare();
    return 0;
}