#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
vector<int>st[100005];
int d[100005];
int main()
{
    freopen("dfs.in","r",stdin);
    freopen("dfs.out","w",stdout);
    int n , m ,x , y,s,i;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        st[x].push_back(y);
    }
    for(i=1;i<=n;i++)d[i]=1000000000;
    queue<int>q;
    d[s]=1;
    q.push(s);
    while(!q.empty())
    {
        s=q.front();
        q.pop();
        for(i=0;i<st[s].size();i++)
            if(d[st[s][i]]>d[s]+1)
            {
                q.push(st[s][i]);
                d[st[s][i]]=d[s]+1;
            }
    }
    for(i=1;i<=n;i++)
        if(d[i]!=1000000000)printf("%d ",d[i]-1);
    else
        printf("-1 ");
return 0;
}