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

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

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

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

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

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

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



    return 0;
}