#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

vector <int> vecini[100001];
int viz[100001];
queue <int> coada;

void bfs ( int nod,int cost[] ){

    int i;
    cost[nod] = 1;
    viz[nod] = 1;
    coada.push(nod);

    while(!coada.empty()){
        for(i = 0;i < vecini[nod].size();i++)
            if(viz[vecini[nod][i]] == 0){
                viz[vecini[nod][i]]= 1;
                cost[vecini[nod][i]] = cost[nod] + 1;
                coada.push(vecini[nod][i]);
            }
        coada.pop();
        if(!coada.empty())
        nod = coada.back();
    }


}

int main()
{
    int n,m,s,i,y, cost[100001];

    ifstream f("bfs.in",ios::in);
    ofstream g("bfs.out",ios::out);
    f>>n>>m>>s;

    while(m){
        f>>i>>y;
        vecini[i].push_back(y);
        m--;
    }

    for(i = 1 ;i <= n; i++)
            cost[i] = 0;
    bfs(s,cost);

     for(i = 1 ;i <= n; i++)
        g<<cost[i] - 1<<" ";
    f.close();
    g.close();

    return 0;
}