#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, m, x, y, s, viz[100001];
int level[100001];
vi g[100001];

void bfs(int nod){
    queue <int> q;
    q.push(nod);
    level[nod]=0;
    viz[nod]=1;
    while(!q.empty()){
        int p=q.front();
        q.pop();
        for(int i=0; i<g[p].sz; i++){
            if(!viz[g[p][i]]){
                viz[g[p][i]]=1;
                q.push(g[p][i]);
                level[g[p][i]]=level[p]+1;
            }
        }
    }
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    cin>>n>>m>>s;
    for(int i=1; i<=m; i++){
        cin>>x>>y;
        if(x!=y) g[x].pb(y);
    }
    bfs(s);
    for(int i=1; i<=n; i++){
        if(level[i]==0 && i!=s) cout<<-1<<" "; else cout<<level[i]<<" ";
    }
}