#include <bits/stdc++.h>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n;
queue < pair < int, int > > q;
int viz[100005];
int dist[100005];
int m;
int x,y,s;
int nrcompconex;
vector < int > v[100005];

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

void bfs() {
    while (q.empty()==0) {
        int nod = q.front().first;
        int distance = q.front().second;
        viz[nod]=1;
        dist[nod]=distance;
        for (int k=0;k<v[nod].size();k++) {
            int nodtoviz = v[nod][k];
            if (viz[nodtoviz]==0) {
                q.push(make_pair(nodtoviz,distance+1));
            }
        }
        q.pop();
    }
}

int main()
{
    f >> n >> m >> s;
    for (int i=1;i<=m;i++) {
        f >> x >> y;
        v[x].push_back(y);
    }
    atribute();
    q.push(make_pair(s,0));
    bfs();
    for(int i=1;i<=n;i++) {
        g << dist[i]<<" ";
    }
    return 0;
}