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

using namespace std;

int n, m, s, x, y;
int d[100005];
vector<int> v[100005];
queue <int> q;

void bfs(int nod)
{
    q.push(nod);
    d[nod]=0;
    while(!q.empty()) {
        int nodCurent = q.front();
        for (auto vecin:v[nodCurent]) {
            if (d[vecin] == -1) {
                q.push(vecin);
                d[vecin] = d[nodCurent] + 1;
            }
        }
        q.pop();
    }
}

int main() {

    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &s);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d", &x ,&y);
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        d[i]=-1;
    bfs(s);
    for(int i=1;i<=n;i++)
        printf("%d ", d[i]);

    return 0;
}