#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, ans[100010], s, x, y;
bool viz[100005];
vector <int> v[100005];
queue <int> q;
void bfs(int s)
{
    viz[s]=1;
    q.push(s);
    ans[s]=0;
    while(!q.empty())
    {
        for(int i=0;i<v[q.front()].size();i++)
            if(ans[v[q.front()][i]]==-1)
        {
            ans[v[q.front()][i]]=ans[q.front()]+1;
            q.push(v[q.front()][i]);
        }
        q.pop();
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    scanf("%d%d%d",&n,&m,&s);
   // memset(ans,-1,n+3);
    for(i=0;i<=n;i++)
        ans[i]=-1;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        printf("%d ",ans[i]);
    return 0;
}