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

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<vector<int>>tabel;
vector<int>d;

void bfs(int start){

    queue<int>q;
    q.push(start);

    d[start] = 0;

    while(!q.empty()){

        auto curent = q.front();
        q.pop();

        for(auto i : tabel[curent]){

            if(d[i] > d[curent] + 1){

                d[i] = d[curent] + 1;
                q.push(i);
            }
        }
    }
}

int main()
{

    int n,m,start;
    fin>>n>>m>>start;

    tabel.resize(n+1);
    d.resize(n+1,1e9);

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

        int a,b;
        fin>>a>>b;

        tabel[a].push_back(b);
    }

    d[start] = 0;

    bfs(start);

    for(int i = 1;i<=n;i++)
        if(d[i] == 1e9)
            fout<<-1<<" ";
        else fout<<d[i]<<" ";

    return 0;
}