#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#define Nmax 100009
#define INF 1000090

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

int n,m,x,y,d[Nmax],parent[Nmax],S;
vector <int> G[Nmax];

void BFS(int node, int d[], int parent[]) {
    for (int i=1; i<=n; ++i) {
        d[i]=INF;
        parent[i]=-1;
    }

    queue <int> Q;
    bitset <Nmax> inQ;

    Q.push(node);
    inQ[node]=1;
    d[node]=0;
    parent[node]=-1;

    while (!Q.empty()) {
        int x=Q.front();
        Q.pop();
        for (auto i : G[x])
            if (d[i]>d[x]+1) {
                d[i]=d[x]+1;
                parent[i]=x;

                if (!inQ[i]) {
                    inQ[i]=1;
                    Q.push(i);
                }
            }
    }
}

int main() {
    f>>n>>m>>S;
    for (int i=1; i<=m; ++i) {
        f>>x>>y;
        G[x].push_back(y);
    }
    BFS(S,d,parent);
    for (int i=1; i<=n; ++i)
        if (d[i]==INF) d[i]=-1;
    for (int i=1; i<=n; ++i)
        g<<d[i]<<' ';
    f.close(); g.close();
    return 0;
}