#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 100010
#define mod 1999999973
using namespace std;
int n,m,s,i,j,x,y,d[nmax];
bitset <nmax> fr;
queue <int> que;
vector <int> g[nmax];
int main() {
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d %d %d",&n,&m,&s);
for (i=1;i<=m;i++) {
    scanf("%d %d",&x,&y);
    g[x].push_back(y);
}
memset(d,-1,sizeof(d));
fr[s]=1; que.push(s); d[s]=0;
while (!que.empty()) {
    x=que.front(); que.pop();
    for (int i=0;i<g[x].size();i++)
        if (fr[g[x][i]]==0) { que.push(g[x][i]); fr[g[x][i]]=1; d[g[x][i]]=d[x]+1; }
}
for (i=1;i<=n;i++) printf("%d ",d[i]);
return 0;
}