#include <fstream>
#include <vector>

using namespace std;

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

const int MAXN = 100000;
int n;

vector<int> L[MAXN + 1];
int dist[MAXN + 1];

void bfs(int start){
    for(int i = 1; i <= n; i++){
        dist[i] = -1;
    }
    dist[start] = 0;
    queue<int> q;
    q.push(start);
    while(q.empty() == false){
        int node = q.front();
        q.pop();
        for(auto vec : L[node]){
            if(dist[vec] == -1){
                dist[vec] = dist[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main(){
    int m, start;
    fin >> n >> m >> start;
    for(int i = 1; i <= m; i++){
        int a, b;
        fin >> a >> b;
        L[a].push_back(b);
    }
    bfs(start);
    for(int i = 1; i <= n; i++){
        fout << dist[i] << " ";
    }

    fin.close();
    fout.close();

    return 0;
}