#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int nmax=100000;
queue <int> q;
vector <int> v;
vector <int> g[nmax+5];
int n,m,s;
int d[nmax+5];
void read(){
    fin>>n>>m>>s;
    for(int i=1;i<=m;++i){
        int x,y;
        fin>>x>>y;
        g[x].push_back(y);
    }
}
void bfs(int start){
    for(int i=1;i<=n;i++)
        d[i]=-1;
    q.push(start);
    d[start]=0;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(auto vecin:g[nod]){
            if(d[vecin]==-1){
                d[vecin]=d[nod]+1;
                q.push(vecin);
            }
        }
    }
}
int main()
{
    read();
    bfs(s);
    for(int i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}