#include <bits/stdc++.h>
#define Dmax 100005

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,start,dist[Dmax];
vector <int> G[Dmax];
queue <int> C;

void BFS(int start)
{
    C.push(start);
    dist[start] = 0;
    while(!C.empty())
    {
        int nod = C.front();
        C.pop();
        for(unsigned int i = 0; i < G[nod].size(); i++)
        {
            int Vecin = G[nod][i];
            if(dist[Vecin] == -1)
            {
                C.push(Vecin);
                dist[Vecin] = dist[nod] + 1;
            }
        }
    }
}

int main()
{
    f>>n>>m>>start;
    for(int i = 1; i <= m; i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        dist[i] = -1;
    BFS(start);
    for(int i = 1; i <= n; i++)
        g<<dist[i]<<" ";

    return 0;
}