#include <bits/stdc++.h>

using namespace std;
#define maxn 100010
ifstream f ("bfs.in");
ofstream g ("bfs.out");
int n,l,m,start;
vector<int>a[maxn];
int q[maxn],s[maxn],v[maxn];
void bfs(int nod)
     {
       int i,j;
       memset(v,-1,sizeof(v));
       l=1;
       v[nod]=0;
       s[l]=nod;
       for (i=1;i<=l;i++)
            for(j=0;j<q[s[i]];j++)
                if (v[a[s[i]][j]]==-1)
                    {
                     s[++l] =a[s[i]][j];
                     v[s[l]] =v[s[i]]+1;
                    }
     }
int main()
{
    int i,x,y;
    f>>n>>m>>start;
    for (i=1;i<=m;i++)
        {
        f>>x>>y;
        a[x].push_back(y);
        }
    for (i=1;i<=n;i++)
         q[i]=a[i].size();
    bfs(start);
    for (i=1;i<=n;i++)
         g<<v[i]<<" ";
    return 0;
}