#include<iostream>
#include<fstream>
#include<queue>
std :: ifstream in("bfs.in");
std :: ofstream out("bfs.out");
using namespace std;

int n , m , s ;
int d[100003];
queue <int> q;
vector <int> a[100003];

int main()
{
    
	
    in>>n>>m>>s;
    for(int i=0;i<m;i++){
        int x,y;
        in>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1;i<=n;i++){
        d[i] = -1;
    }
    queue<int> q;
    q.push(s);
    d[s] = 0;
    while(!q.empty()){
        int x= q.front();
        q.pop();
        for(auto y : a[x]){
            if(d[y]==-1){
                q.push(y);
                d[y] = 1+d[x];
            }
        }
    }
    for(int i=1;i<=n;i++){
        out<<d[i]<<' ';
    }
    return 0;
	
}