#include <fstream>
#include <set>
#include <map>
#include <deque>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
map <int, set<int> > la;
deque <int> q;
bool v[100001];
int d[100001];
int main()
{
    int N, M, S, x, y;
    pair <int, set <int> > a;
    fin >> N >> M >> S;
    for (int i = 1; i <= M; i++)
    {
        fin >> x >> y;
        if (d[x])
        {
            la.lower_bound(x)->second.insert(y);
        }
        else
        {
            a.second.clear();
            a.first = x;
            a.second.insert(y);
            la.insert(a);
            d[x] = 1;
        }
    }
    for (int i = 1; i <= N; i++)
        d[i] = -1;
    q.push_front(S);
    d[q.back()] = 0;
    v[q.back()] = 1;
    while (!q.empty())
    {
        for (auto i : la.lower_bound(q.back())->second)
        {
            if (!v[i])
            {
                v[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;
}