#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

vector<vi> adj(100001);
vector<bool> visited(100001);
vi dist(100001, 1e9);

void bfs(int x){
    queue<int> q;
    dist[x] = 0;
    q.push(x);
    visited[x] = 1;
    while(!q.empty()){
        int u = q.front();
        q.pop();
        for(auto i : adj[u]){
            if(!visited[i]){
                dist[i] = dist[u] + 1;
                visited[i] = 1;
                q.push(i);
            }
        }
    }
}
 
void solve(){
    int n, m, s;
    cin >> n >> m >> s;
    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
    }
    bfs(s);
    for(int i = 1; i <= n; i++){
        if(dist[i] == 1e9)
            cout << -1 << ' ';
        else
            cout << dist[i] << ' ';
    }
}  
 
int main(){
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}