#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
#define nmax 100005
using namespace std;

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

vector<int> v[nmax];
queue<int> q;
int n, m, s;
int dist[nmax];

void bfs(int x){
    for(int i=1; i<=n; i++) dist[i]= -1;
    dist[x]= 0;
    q.push(x);
    while(!q.empty()){
        int cur= q.front();
        q.pop();
        for(int i=0; i<v[cur].size(); i++)
            if(dist[v[cur][i]]==-1){
                dist[v[cur][i]]= dist[cur]+1;
                q.push(v[cur][i]);
            }
    }
    for(int i=1; i<=n; i++) fout << dist[i] << " ";
}

int main(){
    int x, y;
    fin >> n >> m >> s;
    for(int i=1; i<=m; i++){
        fin >> x >> y;
        v[x].push_back(y);
    }
    bfs(s);
    return 0;
}