#include <bits/stdc++.h>

using namespace std;

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

const int N_MAX = 100000 + 5;
const int INF = 0x3f3f3f3f;

queue<int> q;
int costs[N_MAX];
vector<int> vec[N_MAX];

int n, m, s;

int main()
{
    fin >> n >> m >> s;
    while(m--){
        int a, b;
        fin >> a >> b;
        vec[a].push_back(b);
    }

    for(int i = 1; i<=n; ++i)
        costs[i] = INF;

    costs[s] = 0;
    q.push(s);
    while(!q.empty()){
        int node = q.front();
        q.pop();

        for(auto v : vec[node])
            if(costs[v] == INF){
                costs[v] = costs[node] + 1;
                q.push(v);
            }
    }

    for(int i = 1; i<=n; ++i)
        if(costs[i] < INF)
            fout << costs[i] << " ";
        else
            fout << "-1 ";
    return 0;
}