#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <vector<int>> graf;
queue <int> q;
int dist[200005];

void BFS(int st_nod){
    dist[st_nod]=1;
    q.push(st_nod);
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(int ngb: graf[nod]){
            if(dist[ngb]==0){
                dist[ngb] = dist[nod]+1;
                q.push(ngb);
            }
        }
    }

}
int main() {
    int n, m, s;
    fin>>n>>m>>s;
    graf.resize(n+1);

    for(int i=0; i<m; i++){
        int nod1, nod2;
        fin>>nod1>>nod2;
        graf[nod1].push_back(nod2);
    }

    q.push(s);
    BFS(q.front());
    for(int i=0; i<n; i++){
        if(dist[i]==0&& i!=s){
            dist[i]--;
        }
        fout<<dist[i]<<' ';
    }
    return 0;
}