#include <cstdio>
#include <vector>
#include <queue>

#define NMAX 100005

using namespace std;

queue <int>q;
vector <int>v[NMAX];

int best[NMAX];
int n,m,s,nr,x,y;

void bfs(int nod){

   for (int i=1;i<=n;i++)
    best[i]=-1;

   best[nod]=0;
    q.push(nod);

   while (!q.empty()){
    int nodc=q.front();
    q.pop();

    for (auto it:v[nodc])
    if (best[it]==-1){
        best[it]=best[nodc]+1;
        q.push(it);
    }
   }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    scanf("%d %d %d\n",&n,&m,&s);

    for (int i=1;i<=m;i++){
        scanf("%d %d\n",&x,&y);
        v[x].push_back(y);
    }

    bfs(s);

    for (int i=1;i<=n;i++)
     printf("%d ",best[i]);

    fclose(stdin);
    fclose(stdout);
}