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

using namespace std;

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

const int NMAX = 1e5 + 1;
int n;

int viz[NMAX];

vector <int> dist(NMAX, -1);
vector <int> g[NMAX];

void bfs(int s){
    dist[s] = 0;
    viz[s] = 1;
    queue <int> q;
    q.push(s);
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(auto dest:g[nod]){
            if(!viz[dest]){
                viz[dest] = 1;
                dist[dest] = dist[nod] + 1;
                q.push(dest);
            }
        }
    }
}

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

int main()
{
    solve();
    return 0;
}