#include <cstdio>
#include <queue>

using namespace std;
int n,m,i,s,x,y,d[100005];
bool viz[100005];

queue <int> q;
vector <int> v[100005];

void bfs(int x, int d[])
{
    int i;
    q.push(x);
    viz[x]=1;
    while (!q.empty())
    {
        x=q.front();
        q.pop();
        for (i=0; i<v[x].size(); i++)
            if (viz[v[x][i]]==0)
        {
            q.push(v[x][i]);
            d[v[x][i]]=d[x]+1;
            viz[v[x][i]]=1;
        }
    }
}

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);
        v[x].push_back(y);
    }
    bfs(s,d);
    for (i=1; i<=n; i++)
        if (d[i]==0 && i!=s)
            printf("-1 ");
        else printf("%d ",d[i]);
    printf("\n");
    return 0;
}