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

using namespace std;

vector<int> gr[100010];
int viz[100010];
int nivel[100010];

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

int main(){
    int n, m, nod;
    f >> n >> m >> nod;
    for(int i = 0; i < m; ++i){
        int a, b;
        f >> a >> b;
        gr[a].push_back(b);
    }
    for(int i = 1; i <=n ;++i) nivel[i] = -1;
    nivel[nod] = 0;
    viz[nod] = true;
    queue<int> bfs;
    bfs.push(nod);
    while(bfs.size()){
        int node = bfs.front();
        bfs.pop();
        for(int i = 0; i < gr[node].size(); ++i){
            int x = gr[node][i];
            if(viz[x]) continue;
            nivel[x] = nivel[node] + 1;
            viz[x] = true;
            bfs.push(x);
        }
    }

    for(int i = 1; i <= n; ++i){
        g << nivel[i] << ' ';
    }
    return 0;
}