#include <fstream>
#define fisier "bfs"
std::ifstream in(fisier ".in");
std::ofstream out(fisier ".out");
const int N = 100001;
int D[N];
#include <vector>
std::vector<int> L[N];
#include <deque>
int main()
{
    int n, m, s;
    in >> n >> m >> s;
    while (m--)
    {
        int a, b;
        in >> a >> b;
        L[a].push_back(b);
    }
    for (std::deque<int> Q = {s}; Q.size(); Q.pop_front())
        for (int back: L[Q.front()])
            if (back != s and not D[back])
            {
                Q.push_back(back);
                D[back] = D[Q.front()] + 1;
            }
    for (int i = 1; i <= n; i++)
        if (i == s)
            out << "0 ";
        else
            out << (D[i]? D[i]: -1) << ' ';
}