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

///DFS
/*const int maxN = 100000;
vector<int> graf[maxN + 1];
bool viz[maxN + 1];

void dfs(int nod)
{
    viz[nod] = true;
    for (int vecin : graf[nod])
        if (!viz[vecin])
            dfs(vecin);
}

int main()
{
    int N, M;
    f>> N >> M;

    for (int i = 0; i < M; i++)
    {
        int x, y;
        f>> x >> y;
        graf[x].push_back(y);
        graf[y].push_back(x);///graf neorientat
    }

    int nrcomp = 0;
    for (int i = 1; i <= N; i++)
    {
        if (!viz[i])
        {
            dfs(i);
            nrcomp++;
        }
    }

    g<< nrcomp;

}*/
///BFS
const int maxN = 100000;
vector<int> graf[maxN + 1];
int d[maxN + 1];
int N, M, S;
void bfs(int S)
{
    queue<int> q;
    for (int i = 1; i <= N; i++)
        d[i] = -1;

    d[S] = 0;
    q.push(S);

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();

        for (int vecin : graf[nod])
        {
            if (d[vecin] == -1)
            {
                d[vecin] = d[nod] + 1;
                q.push(vecin);
            }
        }
    }
}
int main()
{

    f>> N >> M >> S;

    for (int i = 0; i < M; i++)
    {
        int x, y;
        f>> x >> y;
        graf[x].push_back(y);///graf orientat

    }
    bfs(S);

    for (int i = 1; i <= N; i++)
        g << d[i] << " ";
}