#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100010

using namespace std;

vector<int> edges[NMAX];
queue<int> q;
int cost[NMAX];

void bfs(int vertix)
{
    int node;
    q.push(vertix);
    cost[vertix] = 1;
    while(!q.empty())
    {
        node = q.front();
        q.pop();
        for (auto it:edges[node])
        {
            if (!cost[it])
            {
                q.push(it);
                cost[it] = cost[node] + 1;
            }
        }
    }
}

int main()
{
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    int n, m, s, x, y;
    fin >> n >> m >> s;
    for (int i=1; i<=m; i++)
    {
        fin >> x >> y;
        edges[x].push_back(y);
    }
    bfs(s);
    for (int i=1; i<=n; i++)
        fout << cost[i] - 1 << " ";
    return 0;
}