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

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

const int NMAX = 1e5;

queue <int> q;
vector <int> g[NMAX + 1];
int d[NMAX + 1];

void bfs(int x){

    q.push(x);
    d[x] = 0;

    while(!q.empty()){

        int x = q.front();
        q.pop();

        for(auto y : g[x]){

            if(d[y] == -1){

                d[y] = 1 + d[x];
                q.push(y);

            }

        }

    }

}

int main(){

    int n = 0, m = 0, x0 = 0;
    cin >> n >> m >> x0;

    for(int i = 1; i <= n; i++)
        d[i] = -1;

    for(int i = 0; i < m; i++){

        int x = 0, y = 0;
        cin >> x >> y;

        g[x].push_back(y);
            
    }

    bfs(x0);

    for(int i = 1; i <= n; i++)
        cout << d[i] << " ";

}