#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#define fast ios_base::sync_with_stdio(0);f.tie(0);g.tie(0);
using namespace std;
const string file="bfs";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
#define pb push_back
#define DD 100001
int n,m,s,x,y;
vector<int>v[DD];
int dist[DD];
int main(){
    f>>n>>m>>s;
    for(int i=1; i<=m; ++i){
        f>>x>>y;
        v[x].pb(y);
    }
    queue<int>q;
    vector<bool>d(n+1,0);
    fill(dist,dist+n+1,-1);
    q.push(s);
    d[s]=1;
    dist[s]=0;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(int vecin:v[nod]){
            if(!d[vecin]){
                d[vecin]=1;
                dist[vecin]=dist[nod]+1;
                q.push(vecin);
            }
        }
    }
    for(int i=1; i<=n; ++i) g<<dist[i]<<' ';
    return 0;
}