#include <bits/stdc++.h>
#define NMax 1000001

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

queue<int> qu;
vector<int> graph[NMax];
int sol[NMax], cnt = 0, n, m, s, nod;
bool vis[NMax];

void bfs(int k)
{
    vis[k] = 1;
    qu.push(k);
    while (qu.empty() == 0)
    {
        nod = qu.front();
        qu.pop();
        for (auto i: graph[nod])
        {
            if (vis[i] == 0)
            {
                vis[i] = 1;
                qu.push(i);
                sol[i] = sol[nod] + 1;
            }
        }
    }
}

int main()
{
    int x, y;
    fin>>n>>m>>s;
    for (int i = 1; i <= m; i++)
    {
        fin>>x>>y;
        graph[x].push_back(y);
    }
    bfs(s);
    for (int i = 1; i <=n; i++)
        if (sol[i] == 0 && i != s)
            fout<<"-1"<<" ";
        else
            fout<<sol[i]<<" ";
    return 0;
}