#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
queue<int>q;
vector<int>distanta;
vector<vector<int>>gr;
const int inf=1e9;
void bfs(int nod){
distanta[nod]=0;
q.push(nod);
while(!q.empty()){
    int nod_curent=q.front();
     q.pop();
    for(auto&x:gr[nod_curent]){
        if(distanta[x]!=inf){
            continue;
        }
        distanta[x]=distanta[nod_curent]+1;
        q.push(x);
    }
}
}
int main(){
int n,m,nod;
cin>>n>>m>>nod;
gr.resize(n+1);
distanta.resize(n+1,inf);
int a,b;
for(int i=1;i<=m;i++){
    cin>>a>>b;
    gr[a].push_back(b);
}
bfs(nod);
for(int i=1;i<=n;i++){
    if(distanta[i]==inf){
        cout<<-1<<" ";
    }else{
        cout<<distanta[i]<<" ";
    }
}
}