#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define nmax 100001
using namespace std;

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

vector <int> vecin[nmax];
queue <int> q;
int n,m,s,a,b,i,nod[nmax];
bool viz[nmax];

void bfs(){

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

int main(){
    
    in >> n >> m >> s;
    
    q.push(s);
    
    for (i=1; i<=m; i++){
        in >> a >> b;
        vecin[a].push_back(b);
        
    }
    
    bfs();
    
    for (i=1; i<=n; i++){
        if (nod[i]==0 && i!=s) out << -1 << " ";
        else out << nod[i] << " ";
    }
    
    return 0;
}