#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
queue<int>q;
vector<vector<int>>galeata;
vector<int>distanta;
vector<bool>folosit;
int main(){
    int n,m,s;
    cin>>n>>m>>s;
    int a,b;
    galeata.resize(n+1);
    distanta.resize(n+1,-1);
    folosit.resize(n+1,false);
    while(cin>>a>>b){
        galeata[a].push_back(b);
    }
    distanta[s]=0;
    folosit[s]=true;
    q.push(s);
    while(!q.empty()){
        int nodCurent=q.front();
        q.pop();
        for(auto&vecini:galeata[nodCurent]){
            if(folosit[vecini]){
                continue;
            }else{
                folosit[vecini]=true;
                distanta[vecini]=distanta[nodCurent]+1;
                q.push(vecini);
            }
        }
    }
    for(int i=1;i<=n;i++){
        cout<<distanta[i]<<" ";
    }
    return 0;
}