#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

vector<int> distanta (int sursa, vector < vector<int> > &adj, int n)
{
    vector<int> d(n + 1, n + 1);
    d[sursa] = 0;
    queue<int> q;
    q.push(sursa);
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (auto i : adj[nod])
            if (d[i] > d[nod] + 1)
            {
                d[i] = d[nod] + 1;
                q.push(i);
            }
    }
    for (int i = 1; i <= n; i++)
        if (d[i] == n + 1)
            d[i] = -1;
    return d;
}

int main()
{
    ifstream fin ("bfs.in");
    ofstream fout ("bfs.out");
    int n, m, a, b, k;
    fin >> n >> m >> k;
    vector<int> p;
    vector < vector<int> > adj(n + 1);
    for (int i = 0; i < m; i++)
    {
        fin >> a >> b;
        adj[a].push_back(b);
    }
    p = distanta (k, adj, n);
    for (int i = 1; i <= n; i++)
        fout << p[i] << " ";

    return 0;
}