#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> l[100001];
deque <int> q;
int d[100001];
int main()
{
    int N, M, S, x, y;
    fin >> N >> M >> S;
    for (int i = 1; i <= M; i++)
    {
        fin >> x >> y;
        l[x].push_back(y);
    }
    memset(d, -1, sizeof(d));
    q.push_front(S);
    d[q.back()] = 0;
    while (!q.empty())
    {
        for (auto i : l[q.back()])
        {
            if (d[i] == -1)
            {
                d[i] = d[q.back()] + 1;
                q.push_front(i);
            }
        }
        q.pop_back();
    }
    for (int i = 1; i <= N; i++)
        fout << d[i] << " ";
    return 0;
}