#include <queue>
#include <stdio.h>
#include <vector>
#include <fstream>
using namespace std;

int n, m, s;
vector<int> v[100002];
queue<int> coada;
int a[100002];
//bool p[100002];



int main()
{
	memset(a,-1,sizeof(a));
   // ifstream fin("bfs.in");
freopen("bfs.in","r",stdin);
    //fin >> n >> m >> s;
scanf("%d%d%d",&n,&m,&s);
    int x, y;
    for (int i = 1; i <= m; ++i)
    {
        //fin >> x >> y;
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }

    a[s] = 0;
      int nod;
     coada.push(s);
     while (!coada.empty())
     {
         nod = coada.front();
     //    fout << nod << " ";
         for (int i = 0; i < v[nod].size(); ++i)
         {
             if (a[v[nod][i]]==-1)
             {
                 a[v[nod][i]] = a[nod] + 1;
                
                 coada.push(v[nod][i]);
             }
         }
         coada.pop();
     }
    //   fout << "\n\n";
    
   // ofstream fout("bfs.out");
     freopen("bfs.out","w",stdout);
    for (int i = 1; i <= n ; ++i)
    {
        if (a[i]==-1)
        {
          //  fout << "-1 ";
        	printf("-1 ");
        }
        else
           // fout << a[i] << " ";
        	printf("%d ",a[i] );
    }

}













/* for (int i = 1; i <= n; ++i)
 {
     fout << i << " ";
     for (int j = 0; j < v[i].size(); ++j)
     {
         fout << v[i][j] << " ";
     }
     fout << "\n";
 }*/