#include <fstream>
#include <bitset>
#include <queue>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

struct Node {
    int val;
    Node* next;
};

int const NMAX = 1e5 + 1;
int N, M, S, x, y, d[NMAX];
bitset<NMAX> vis;
Node* adj[NMAX];
queue<int> Q;

inline void addEdge(int const &u, int const &v) {
    Node* p = new Node;
    p->val = v;
    p->next = adj[u];
    adj[u] = p;
}

int main() {
    fin >> N >> M >> S;
    while (M--) {
        fin >> x >> y;
        addEdge(x, y);
    }
    Q.push(S);
    vis[S] = 1;
    while (!Q.empty()) {
        x = Q.front();
        Q.pop();
        Node *p = new Node;
        for (p = adj[x]; p != NULL; p = p->next) {
            y = p->val;
            if (!vis[y]) {
                vis[y] = 1;
                d[y] = d[x] + 1;
                Q.push(y);
            }
        }
    }
    for (int i = 1; i <= N; i++)
        if (!vis[i])
            fout << "-1 ";
        else
            fout << d[i] << ' ';
    fout << '\n';
    fin.close();
    fout.close();
    return 0;
}