#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
#define N 100005

using namespace std;

int n, m, d[N], st;
vector <int> graf[N];
queue <int> q;

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

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d %d %d\n", &n, &m, &st);
    for(int i=1;i<=m;i++)
    {
        int x, y;
        scanf("%d %d\n", &x, &y);
        graf[x].push_back(y);
    }
    parcurg(st);

    for(int i=1;i<=n;i++)
        printf("%d ", d[i]-1);
    return 0;
}