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

using namespace std;

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

vector <int> a[100001];

queue <int> q;

int viz[100001];

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

int main() {
    int n,m,nod;
    in>>n>>m>>nod;
    for(int i=1;i<=m;i++){
        int x,y;
        in>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        viz[i]=-1;
    bfs(nod);
    for(int i=1;i<=n;i++)
        out<<viz[i]<<' ';
    return 0;
}