#include <iostream>
#include <vector>
#include <queue>
#pragma GCC optimize("O3")

using namespace std;

#define INFILE "dfs.in"
#define OUTFILE "dfs.out"
const int NMAX = 1e5 + 2;
const int INF = 1e9;

vector<int> adj[NMAX];
bool viz[NMAX];
int dist[NMAX];

void dfs(int nod){

    viz[nod] = 1;

    for(int i = 0; i < adj[nod].size(); ++i){

        int to = adj[nod][i];

        if(!viz[to]){
            dfs(to);
        }
    }

}
void bfs(int source){
    queue<int> q;
    q.push(source);
    dist[source]=0;
    viz[source]=1;
    while(!q.empty())
    {
        int nod =q.front();
        q.pop();
        for(auto& to : adj[nod])
        {
            if(!viz[to]){
                viz[to]=1;
                dist[to]=dist[nod]+1;
                q.push(to);
            }
        }
    }
}

int main(){
    
    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);
    cout.tie(nullptr);

    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);

    int n, m, s;

    cin >> n >> m >> s ;

    for(int i = 1; i <= m; ++i){

        int x, y;

        cin >> x >> y;

        adj[x].push_back(y);
    }

//    int nrComp = 0;
//
//    for(int nod = 1; nod <= n; ++nod){
//
//        if(!viz[nod]){
//
//            dfs(nod);
//
//            ++nrComp;
//
//        }
//
//    }
//
//    cout << nrComp << '\n';
    for (int i = 1; i <= n; i++)
        {
            dist[i] = -1;
        }

        bfs(s);

    for (int nod = 1; nod <= n; nod++)
        {
            cout << dist[nod] << ' ';
        }
        cout << '\n';

    return 0;
}