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

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

vector <int> v[100001];
int n, m, s, viz[100001], dist[100001]={-1};
queue <int> q;


void bfs(int nod) {
    int cnt = 0;
    q.push(nod);
    viz[nod] = 1;
    while (!q.empty()) {
        nod = q.front();
        for (int i = 0; i < v[nod].size(); i++) {
            int fiu = v[nod][i];
            if (viz[fiu] == 0) {
                q.push(fiu);
                viz[fiu] = 1;
                dist[fiu] = dist[nod] + 1;
            }
            
        }
        
        cnt++;
        
        q.pop();
    }
}

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