#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

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

const int maxn = 100001;

vector<int> vecini[maxn];
int cost[maxn];

void bfs(int nod)
{
    fill(cost, cost+maxn, -1);
    cost[nod] = 0;
    queue<int> qu; qu.push(nod);
    while (!qu.empty())
    {
        int extras = qu.front();
        for (int i = 0; i < vecini[extras].size(); i++)
        {
            if (cost[vecini[extras][i]] == -1)
            {
                cost[vecini[extras][i]] = cost[extras] + 1;
                qu.push(vecini[extras][i]);
            }
        }
        qu.pop();
    }
}

int main()
{
    int n, m, s, x, y;
    in >> n >> m >> s;
    for (int i = 0; i < m; i++)
    {
        in >> x >> y;
        vecini[x].push_back(y);
    }
    bfs(s);
    for (int i = 1; i <= n; i++)
        out << cost[i] << ' ';
    return 0;
}