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

using namespace std;

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

const int NMAX = 100005;

int d[NMAX];
bool viz[NMAX];

vector <int> g[NMAX];

void bfs(int node){
    d[node] = 0;
    viz[node] = 1;
    queue <int> q;
    q.push(node);
    while(!q.empty()){
        int from = q.front();
        q.pop();
        for(int j = 0; j < g[from].size(); ++j){
            int to = g[from][j];
            if(viz[to] == 0){
                viz[to] = 1;
                d[to] = d[from] + 1;
                q.push(to);
            }
        }
    }
}

void solve(){
    int n, m, start;
    fin >> n >> m >> start;
    for(int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i){
        d[i] = -1;
    }
    bfs(start);
    for(int i = 1; i <= n; ++i){
        fout << d[i] << " ";
    }
}

int main()
{
    solve();
    return 0;
}