#include <fstream>
#include <vector>
#include <queue>
#include <mem.h>
#define NMAX 100005


using namespace std;

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

int n, m, S, nod1, nod2, cost[NMAX];
vector<int> graf[NMAX];
queue<int> q;

int main()
{
    f >> n >> m >> S;
    for(int i=1; i<=m; i++){
        f >> nod1 >> nod2;
        graf[nod1].push_back(nod2);
    }
    memset(cost,-1,sizeof(cost));
    cost[S] = 0;
    q.push(S);
    while(!q.empty()){
        int val = q.front();
        q.pop();
        for(int i=0; i<graf[val].size(); i++){
            if(cost[graf[val][i]] == -1){
                q.push(graf[val][i]);
                cost[graf[val][i]] = cost[val] + 1;
            }
        }
    }
    for(int i=1; i<=n; i++){
        g << cost[i] << ' ';
    }
    g << '\n';
    return 0;
}