#include <fstream>
#include <vector>

using namespace std;

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

int n,m,start,C[100001],v[100001],i,x,y,p,u;
vector<int> L[100001];

int main()
{
    fin >> n >> m >> start;
    for (i=1; i<=m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    p = u = 1;
    C[1] = start;
    v[start] = 1;
    while (p <= u)
    {
        for (i=0; i<L[C[p]].size(); i++)
        {
            int vecin = L[C[p]][i];
            if (v[vecin] == 0)
            {
                C[++u] = vecin;
                v[vecin] = 1+v[C[p]];
            }
        }
        p++;
    }
    for (i=1; i<=n; i++)
        fout << v[i]-1 << " ";
    return 0;
}