#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, i, s, a, b;
vector<int> ad[100005];
queue<int> q;
int dist[100005];

int main()
{
    fin>>n>>m>>s;

    for(i=1;i<=m;i++){
        fin>>a>>b;
        ad[a].push_back(b);
    }

    for(i=1;i<=n;i++){
        dist[i]=-1;
    }

    dist[s]=0;
    q.push(s);
    while(!q.empty()){
        int nod=q.front();
        q.pop();

        for(i=0;i<ad[nod].size();i++){
            int vecin=ad[nod][i];
            if(dist[vecin]==-1){
                dist[vecin]=dist[nod]+1;
                q.push(vecin);
            }
        }
    }

    for(i=1;i<=n;i++){
        fout<<dist[i]<<" ";
    }



    return 0;
}