#include<fstream>
#include<queue>
#include<vector>
using namespace std;

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

int viz[100010], n,m,s;
vector <int> nod[100010];
queue <int> coada;


void bfs(){
    while(!coada.empty()){
        int nd = coada.front();
        coada.pop();
        for(int i = 0; i < nod[nd].size(); ++i){
            int t = nod[nd][i];
            if(!viz[t]){
                    viz[t] = viz[nd] + 1;
                    coada.push(t);

            }
        }
    }
}

int main(){
    cin>>n>>m>>s;
    while(m--){
        int x, y;
        cin>>x>>y;
        nod[x].push_back(y);
    }
    coada.push(s);
    viz[s] = 1;
    bfs();


    for(int i =1; i<=n; ++i){
        cout<<viz[i] - 1<<' ';
    }

    return 0;
}