#include <cstdio>
#include <vector>
#include <queue>
#define NMAX 100010
using namespace std;

int n,m,s,i,x,y,sol[NMAX];
vector <int> G[NMAX];
queue <int> q;

void bfs()
{
    int t,sz,x;
    sol[s]=0;
    q.push(s);
    while(!q.empty())
    {
        t=q.front();
        sz=G[t].size();
        for(i=0; i<sz; ++i)
        {
            x=G[t][i];
            if(sol[x]==-1)
            {
                sol[x]=sol[t]+1;
                q.push(x);
            }
        }
        q.pop();
    }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    for(i=1; i<=m; ++i)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
    for(i=1; i<=n; ++i)
        sol[i]=-1;
    bfs();
    for(i=1; i<=n; ++i)
        printf("%d ",sol[i]);

    return 0;
}