#include<fstream>
#include<iostream>
#include<climits>
#include<algorithm>
#include<cstring>
#include<cmath>
#include <vector>
#include <queue>

#define MAX 100005

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

//ifstream f("in.in");
//ofstream g("out.out");

vector <int> l[MAX+5];
queue <int> q;

int n,m,s,x,y;
int d[MAX+5];
bool viz[MAX+5];

void bfs(int start){
    viz[start] = 1;
    q.push(start);
    while(!q.empty()){
        int nod = q.front();
        for(int i=0;i<l[nod].size();i++){
            int vecin = l[nod][i];
            if(viz[vecin] == 0){
                viz[vecin] = 1;
                d[vecin] = d[nod]+1;
                q.push(vecin);
            }
        }
        q.pop();
    }
}

int main(){

    f>>n>>m>>s;

    for(int i=1;i<=m;i++){
        f>>x>>y;
        l[x].push_back(y);
    }

    bfs(s);

    for(int i=1;i<=n;i++){
        if(i == s){
            g<<0<<" ";
        }else{
            if(d[i] == 0){
                g<<-1<<" ";
            }else{
                g<<d[i]<<" ";
            }
        }
    }

    f.close();
    g.close();
    return 0;
}