#include <cstdio>
#include <vector>
#define pb push_back
#define Nmax 100010

using namespace std;

vector <int> g[Nmax];
vector <int> ::iterator it;
int t[Nmax],lg[Nmax],q[Nmax],i,j,n,m,x,y,s;
bool sel[Nmax];

void bfs(int nod)
 {
     sel[nod]=true; lg[nod]=t[nod]=0;
     q[1]=nod; int p=1,u=1;
     while (p<=u)
      {
          x=q[p];
          for (it=g[x].begin();it!=g[x].end();++it)
           if (!sel[*it]){
               q[++u]=*it; sel[*it]=true; t[*it]=x;
               lg[*it]=lg[x]+1;
           }
           ++p;
      }
 }

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].pb(y);
        // g[y].pb(x);
     }

    for (i=1;i<=n;++i) lg[i]=-1;
    bfs(s);

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

    return 0;
}