#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector<int> distanta(int sursa, int n, vector<vector<int>> adj)
{
    vector<int> d(n + 1, n + 1);
    queue<int> q;
    d[sursa] = 0;
    q.push(sursa);
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (auto vecin : adj[nod])
            if (d[vecin] > d[nod] + 1)
            {
                d[vecin] = d[nod] + 1;
                q.push(vecin);
            }
    }
    return d;
}
int main()
{
    ifstream fin ("bfs.in");
    ofstream fout ("bfs.out");
    int n, m, a, b, i, sursa;
    fin >> n >> m >> sursa;
    vector<vector<int>> adj(n + 1);
    for (i = 0; i < m; i++)
    {
        fin >> a >> b;
        adj[a].push_back(b);
    }
    vector <int> v = distanta(sursa, n, adj);
    for (i = 1; i <= n; i++)
        if (v[i] == n + 1)
            fout << -1 << " ";
        else
            fout << v[i] << " ";
	return 0;
}