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

using namespace std;

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

vector <int> Graf[100001];
int cost[100001];
int viz[100001];
queue <int> bfs;


int main() {
    int n, m, sursa,x, a, b, curent;
    fin >> n >> m;
    fin >> sursa;
    bfs.push(sursa);
    viz[sursa] = 1;
    cost[sursa] = 0;
    for (int i = 0; i < m; i++)
    {
        fin >> a >> b;
        Graf[a].push_back(b);
    }
    while (!bfs.empty())
    {
        curent = bfs.front();
        bfs.pop();
        for (auto i: Graf[curent])
        {
            if (viz[i] != 1)
            {
                bfs.push(i);
                viz[i] = 1;
                cost[i] = cost[curent] + 1;
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (viz[i] != 1)
        {
            fout << "-1 ";
        }
        else {
            fout << cost[i]<<" ";
        }
    }
    return 0;
}