#include <bits/stdc++.h>

using namespace std;

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

const int MAXN = 100005;

int dist[MAXN];
vector <int> v[MAXN];
int n, edge, start, x, y;

void bfs(int nodStart){
    for(int i=1; i<=n; i++)
        if(i != nodStart)
            dist[i] = (1 << 30);

    queue <int> q; int nod, vecin;
    q.push(nodStart);
    while(!q.empty()){
        nod=q.front();
        q.pop();

        for(int i=0; i<v[nod].size(); i++){
            vecin = v[nod][i];

            if(dist[nodStart] + 1 < dist[vecin]){
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main (){
    fin>>n>>edge>>start;
    while(edge--){
        fin>>x>>y;
        v[x].push_back(y);
    }

    bfs(start);

    for(int i=1; i<=n; i++){
        if(dist[i] == (1 << 30))
            fout<<"-1 ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}