#include <iostream>
#include <queue>
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout ("bfs.out");
int n,m,s,y;
int drum[100001];
queue<int> q;
vector <vector <int>> a;


void bfs(int x)
{
    q.push(x);
    drum[x]=1;
    while (!q.empty())
    {
        y=q.front();
        q.pop();
        for(int vecin: a[y])
        {
            if(drum[vecin]==0)
            {

                q.push(vecin);
                drum[vecin]=drum[y]+1;
            }
        }
    }
}
void cit()
{
    fin>>n>>m>>s;
    int x,y;
    a.resize(n+1);
    for (int i=1;i<=m;i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
}
int main()
{
  cit();
  bfs(s);
  for(int i=1;i<=n;i++)
  {
      fout << drum[i]-1 <<" " ;
  }
  return 0;
}