#include<fstream>
#include<vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int v[100001],c[100001],n,m,s,i,x,y;
vector <int> L[100001];
void bfs(int nod){
    int p,u,prim;
    p = 1;
    u = 1;
    c[p] = nod;
    v[nod] = 1;
    while (p<=u) {
        // analizam vecinii lui c[p] si pe cei nevizitati ii punem in coada
        prim = c[p];
        for (i=0;i<L[prim].size();i++)
            if (v[ L[prim][i]  ] == 0) {
                u++;
                c[u] = L[prim][i];
                v[  L[prim][i] ] = 1 + v[  prim ];
            }
        p++;
    }
}
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++){
        f>>x>>y;
        L[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        g<<v[i]-1<<" ";
    return 0;
}