#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,a,b;
queue <int> q;
int viz[100001];
int d[100001];
vector <int> v[100001];

int main()
{
   fin>>n>>m>>s;
   for(int i=1;i<=m;i++)
   {
       fin>>a>>b;
       v[a].push_back(b);

   }
   q.push(s);
   viz[s]=1;
   while(!q.empty())
   {
       for(auto i:v[q.front()])
       {
           if(viz[i]==0)
           {
               viz[i]=1;
               d[i]=d[q.front()]+1;
               q.push(i);
           }
       }
       q.pop();
   }
for(int i=1;i<=n;i++)
    {
        if(d[i]==0 && i!=s)
            fout<<"-1 ";
        else fout<<d[i]<<' ';
    }

    return 0;
}