#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> l[100001];
int c[100001], d[100001], n, m, s, x, y, nod, p, u;
int main()
{
    fin>>n>>m>>s;
    for (int i=1; i<=m; i++)
    {
        fin>>x>>y;
        l[x].push_back(y);
    }

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

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