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

#define NLIM 100005

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

int drum[NLIM];

vector<int> muchii[NLIM];
queue<int> coada;

void bfs(int nod, int distanta)
{
    coada.pop();
    drum[nod] = distanta;

    for(unsigned int i = 0; i < muchii[nod].size(); i++)
    {
        int vecin = muchii[nod][i];
        if(drum[vecin] == -1 || drum[vecin] > distanta + 1) {
            bfs(vecin, distanta + 1);
        }
    }
}

int main()
{
    int n, m, s, a, b;
    f>>n>>m>>s;

    for(int i = 0; i < m; i++)
    {
        f>>a>>b;
        muchii[a].push_back(b);
    }

    for(int i = 1; i <= n; i++)
        drum[i] = -1;

    bfs(s, 0);

    for(int i = 1; i <= n; i++)
        g<<drum[i]<<" ";
}