#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

queue <int> q;

int viz[100005];
vector <int> v[100005];

int n,m,s;

void bfs(int nod){
    q.push(nod);
    viz[s]=0;
    while(!q.empty()){
        nod=q.front();
        q.pop();
        for(auto it:v[nod]){
            if(viz[it]==-1){
                viz[it]=viz[nod]+1;
                q.push(it);
            }
        }
    }
}

int a,b;

int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=n;i++)
        viz[i]=-1;
    for(int i=1;i<=m;i++){
        fin>>a>>b;
        v[a].push_back(b);
    }
    bfs(s);
    for(int i=1;i<=n;i++){
        fout<<viz[i]<<' ';
    }
    return 0;
}