#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;

ifstream fin("dfs.in");
ofstream fout("dfs.out");

int n, m, s;
vector<int> v[100005];
int d[100005];
queue<int> q;

int main()
{
    fin >> n >> m >> s;

    for (int i = 0; i < m; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
        d[i] = -1;

    d[s] = 0;
    q.push(s);

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();

        for (int i = 0; i < v[nod].size(); i++)
        {
            int vecin = v[nod][i];

            if (d[vecin] == -1)
            {
                d[vecin] = d[nod] + 1;
                q.push(vecin);
            }
        }
    }

    for (int i = 1; i <= n; i++)
        fout << d[i] << " ";
    fout << "\n";
    
    fin.close();
    fout.close();

    return 0;
}