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

using namespace std;

vector<int> g[100001];
int visit[100001];
int dist[100001];
int n;

void bfs(int rad)
{
	queue<int> q;

	for(int i=1;i<=n;i++)
    {
        dist[i]=INT_MAX;
    }

    dist[rad] = 0;
    q.push(rad);

    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for(int i=0; i<g[u].size();i++)
        {
            if(visit[g[u][i]]==0)
            {
                q.push(g[u][i]);

                if (dist[g[u][i]] > dist[u] + 1)
                    dist[g[u][i]] = dist[u] + 1;
            }
        }
        visit[u]=1;
    }
}

int main()
{
    int m,s;
    fstream f, out;
	f.open("bfs.in", ios::in);
	out.open("bfs.out", ios::out);

    f >> n >> m >> s;
	for (int i = 0; i < m; i++)
	{
		int x, y;
		f >> x >> y;

		//graf neorientat initial
		g[x].push_back(y);
	}

    bfs(s);

    for (int i=1;i<=n;i++)
        if(dist[i] == INT_MAX)
            out<<"-1 ";
        else
            out<<dist[i]<<" ";

    return 0;
}