#include <bits/stdc++.h>

using namespace std;

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

int n,m,start;
vector<int>adj[100005];

int dist[100005];

int main()
{
    int i,x,y;
    f >> n >> m >> start;
    for(i = 1; i <= m; i++)
    {
        f >> x >> y;
        adj[x].push_back(y);
    }

    for(i = 1; i <= n; i++)
    {
        dist[i] = -1;
    }
    queue<int> q;
    dist[start] = 0;
    q.push(start);
    while(!q.empty())
    {
        int nod_curent = q.front();
        q.pop();
        for(i = 0; i < adj[nod_curent].size(); i++)
        {
            int vecin = adj[nod_curent][i];
            if(dist[vecin] == -1)
            {
                dist[vecin] = dist[nod_curent] + 1;
                q.push(vecin);
            }
        }
    }
    for(i = 1; i <= n; i++)
    {
        g << dist[i] << " ";
    }

    return 0;
}