#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
#define NMAX 100001
 
using namespace std;
 
ifstream fin("bfs.in");
ofstream fout("bfs.out");
 
vector<int> G[NMAX];
vector<int> SOL;
queue<int> Q;
int n;
 
void bfs(int s) {
    SOL.resize(n+1, -1);
    int nod;
    Q.push(s);
    SOL[s] = 0;
    while(!Q.empty()) {
        nod = Q.front();
        Q.pop();
        for(vector<int>::iterator it=G[nod].begin(); it!=G[nod].end(); ++it) {
            if(SOL[*it] == -1) {
                SOL[*it] = SOL[nod] + 1;
                Q.push(*it);
            }
        }
    }
}
 
void read() {
    int s, m;
    fin>>n>>m>>s;
    int a, b;
    while(m--) {
        fin>>a>>b;
        G[a].push_back(b);
    }
    bfs(s);
    for(int i=1; i<=n; i++) {
        fout<<SOL[i]<<" ";
    }
}
 
int main() {
    read();
    return 0;
}