#include <fstream>
#include <queue>
#include <vector>
#include <cstring>

using namespace std;

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

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

int main ()
{
    int x, y, nod;

    fin >> n >> m >> s;
    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    memset(d,-1,sizeof(d));
    Q.push(s);
    d[s] = 0;
    while (!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        for (vector<int> :: iterator it = v[nod].begin(); it != v[nod].end(); ++it)
            if (d[*it] == -1)
            {
                Q.push(*it);
                d[*it] = d[nod] + 1;
            }
    }

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