#include <bits/stdc++.h>
using namespace std;
int n,m,x,xi,xj,i;
vector<int>a[100005],viz;
queue<int>c;
ifstream f("bfs.in");
ofstream g("bfs.out");
void bfs ( int start)
{
    viz[start]=1;
    int st=1,dr=0;
    c.push(start);
    dr++;
    while(st<=dr)
    {
        int k=c.front();
        for(i=0;i<a[k].size();i++)
        {
            int temp=a[k][i];
            if(viz[temp]==0) {viz[temp]=viz[k]+1; c.push(temp);dr++;}
        }
        st++;
        c.pop();

    }
    for(i=1;i<=viz.size();i++)
      if(viz[i]==0&&i==start)  g<<"0 ";
       else  g<<viz[i]-1<<" ";
}
int main()
{


    f>>n>>m>>x;
    for(i=0;i<n;i++)
        viz.push_back(0);
    for(i=1;i<=m;i++)
    {
        f>>xi>>xj;
        a[xi].push_back(xj);
    }
    bfs(x);
    return 0;
}