#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int main(){
    int n, m, s, x, y;
    fin >> n >> m >> s;
    vector<vector<int>> G(n + 1);
    vector<int> d(n + 1, -1);

    for(int i = 0; i < m; i ++){
        fin >> x >> y;
        G[x].push_back(y);
    }

    queue<int> q;
    q.push(s);
    d[s] = 0;
    while(!q.empty()){
        x = q.front();
        q.pop();
        for(const auto& y: G[x])
            if(d[y] == -1){
                d[y] = d[x] + 1;
                q.push(y);
            }
    }

    for(int i = 1; i <= n; i ++)
        fout << d[i] << " ";

    return 0;
}