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

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

vector<int> l[100005];
int v[100005], c[100005];
int n, m, start, x, y, i;

void bfs(int nod)
{
    int p = 1;
    int u = 1;
    v[nod] = 1;
    while(p <= u)
    {
        for(int i = 0; i < l[c[p]].size(); i++)
        {
            if(v[l[c[p]][i]] == 0)
            {
                v[l[c[p]][i]] = v[c[p]] + 1;
                u++;
                c[u] = l[c[p]][i];
            }
        }
        p++;
    }
}

int main()
{
    fin >> n >> m >> start;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        l[x].push_back(y);
    }

    bfs(start);

    for(int i = 1; i <= n; i++)
    {
        fout << v[i] -1 << " ";
    }
    fout << "\n";
    return 0;
}