#include<cstdio>
#include<vector>
#include<queue>
std::vector<int> v[100001];
std::queue<int> coada;
std::vector<int> viz(100001);
void lee(int S)
{
 coada.push(S);
 viz[S]=1;
 while(!coada.empty())
       {
        int nod=coada.front();
        coada.pop();
        for(std::vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
            {
             if(viz[*it]==0)
                {
                 viz[*it]=viz[nod]+1;
                 coada.push(*it);
                }
            }
       }
}
int main()
{
 freopen("bfs.in","r",stdin);
 freopen("bfs.out","w",stdout);
 int n,m,S;
 scanf("%d %d %d ",&n,&m,&S);
 for(int i=1;i<=m;i++)
     {
      int a,b;
      scanf("%d %d ",&a,&b);
      v[a].push_back(b);
      //v[b].push_back(a);
     }
 lee(S);
 for(int i=1;i<=n;i++)
     {
      printf("%d ",viz[i]-1);
     }
 fclose(stdin);
 fclose(stdout);
return 0;
}