#include <cstdio>
#include <cassert>
#include <vector>

const int nmax=100005;
using namespace std;
int s[nmax],q[nmax];
vector <int> v[nmax];

int main()
{
    int n=0,m=0,k=0,x=0,y=0,stop=0,i=0,j=0;

    assert(freopen("bfs.in","r",stdin));
    assert(freopen("bfs.out","w",stdout));

    assert(scanf("%d%d%d",&n,&m,&k));

    for (i=0; i<m; ++i)
    {
        assert(scanf("%d%d",&x,&y));
        v[x].push_back(y);
    }

    stop=1;
    q[1]=k;
    s[k]=1;

    for (i=0; i<stop;)
    {
        ++i;
        for(j=0; j<v[q[i]].size(); ++j)
            if(s[v[q[i]][j]]==0)
            {
                ++stop;
                q[stop]=v[q[i]][j];
                s[v[q[i]][j]]=s[q[i]]+1;
            }
    }

    for(i=1; i<=n;)
    {
        assert(printf("%d\n",s[i]-1));
        ++i;
    }

    return 0;
}