#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
typedef unsigned long long ull;



const int sze = 100000;
vector<int> G[sze + 1];
bitset<sze + 1> F;
int *D = nullptr;
void bfs(int x){
    queue<int> q;
    F[x] = 1;
    D[x] = 0;
    q.push(x);
    while(!q.empty()){
        auto t = q.front();
        q.pop();
        for(int i : G[t]){
            if(!F[i]){
                F[i] = 1;
                D[i] = D[t] + 1;
                q.push(i);
            }
        }
    }
}




int main()
{
    int n, m, k;
    fin>>n>>m>>k;
    D = new int[n + 1];
    for(int i = 1;i<=n;++i) D[i] = -1;

    for(int i = 1;i<=m;++i){
        int a, b;
        fin>>a>>b;
        G[a].push_back(b);
    }
    bfs(k);
    for (int i =1; i<=n;++i){
        fout<<D[i]<<" ";
    }
    

    return 0;
}