#include <bits/stdc++.h>
#define NUM 100005
using namespace std;
vector <int> graf[NUM];
int cost[NUM], coada[NUM];
int n, m, a, b, start, lng;
ifstream f("bfs.in");
ofstream g("bfs.out");
void bfs(int nod)
{
    for(int i = 1; i <= n; ++i)
        cost[i] = -1;

    lng = 1;
    cost[nod] = 0;
    coada[lng] = nod;

    for(int i = 1; i <= lng; ++i)
    {
        for(int j = 0; j < graf[coada[i]].size(); ++j)
        {
            if(cost[graf[coada[i]][j]] == -1)
            {
                coada[++lng] = graf[coada[i]][j];
                cost[coada[lng]] = cost[coada[i]] + 1;
            }
        }
    }
}
int main()
{
    f >> n >> m >> start;
    for(int i = 0; i < m; ++i)
    {
        f >> a >> b;
        graf[a].push_back(b);
    }

    bfs(start);

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