#include<fstream>
#include<vector>
#include<deque>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,i,inc,x,y,fin[100005];
bool viz[100005];
vector<int> a[100005];
deque<int> q;
int main()
{
    f>>n>>m>>inc;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    fin[inc]=1;
    q.push_back(inc);
    while(!q.empty())
    {
        viz[q.front()]=1;
        for(i=0;i<a[q.front()].size();i++)
          if(viz[a[q.front()][i]]==0)
          {
              fin[a[q.front()][i]]=fin[q.front()]+1;
              viz[a[q.front()][i]]=1;
              q.push_back(a[q.front()][i]);
          }
        q.pop_front();
    }
    for(i=1;i<=n;i++)
      g<<fin[i]-1<<" ";
    return 0;
}