#include <stdio.h>
#include <list>
#include <queue>

using namespace std;

int viz[100001],
    d[100001];

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,i,x,y,m,s;
    list<int> v[100001];
    list<int>::const_iterator itr,fin;
    queue<int> c;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=n;i++)
        d[i]=-1;
    for(i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    c.push(s);viz[s]=1;d[s]=0;
    while(!c.empty())
    {
        x=c.front();
        c.pop();
        itr=v[x].begin();
        fin=v[x].end();
        for(;itr!=fin;itr++)
        {
            if(viz[*itr]==0) {viz[*itr]=1;d[*itr]=d[x]+1;c.push(*itr);}
        }
    }
    for(i=1;i<=n;i++)
        printf("%d ",d[i]);

    return 0;
}