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

using namespace std;

#define MAX 1000010

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

int n,m,start;
vector <int>g[MAX];
queue <int>q;
int dist[MAX];

void bfs(int nod){
    q.push(nod);
    while(!q.empty()){
        int nd=q.front();
        q.pop();
        for(int i=0;i<g[nd].size();i++)
            if(dist[g[nd][i]]==-1){
                q.push(g[nd][i]);
                dist[g[nd][i]]=dist[nd]+1;
        }
    }
}

int main()
{
    fin>>n>>m>>start;
    for(int i=1;i<=m;i++){
        int x,y;
        fin>>x>>y;
        g[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        dist[i]=-1;
    dist[start]=0;
    bfs(start);
    for(int i=1;i<=n;i++)
        fout<<dist[i]<<" ";
    fout<<"\n";
    return 0;
}