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

const int NMAX = 1e5;
std::vector<int> G[NMAX+1];
int vis[NMAX+1], d[NMAX+1];

void BFS(int x){
    std::queue<int>q;
    q.push(x);
    vis[x] = 1;
    d[x] = 0;
    while(!q.empty()){
        x = q.front();
        q.pop();
        for(auto next:G[x]){
            if(!vis[next])
            {
                q.push(next);
                vis[next] = 1;
                d[next] = d[x] + 1;
            }
        }
    }
}

int main() {
    int n, m, s;
    std::ifstream f;
    std::ofstream g;
    f.open("bfs.in");
    f>>n>>m>>s;
    for(int i = 1; i <= m; i++){
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
    }
    f.close();
    BFS(s);
    g.open("bfs.out");
    for(int i = 1; i <= n; i++){
        if(i != s and d[i] == 0)
            g<<-1<<' ';
        else
            g<<d[i]<<' ';
    }
    g.close();
    return 0;
}