#include <stdio.h>
#include <vector>
#include <queue>

#define print(a) printf("%d ", a)
#define scan(a) scanf("%d", &a)

#define maxn 100000

using std::vector;
using std::queue;

int n, m, s, d[maxn];
vector<int> G[maxn];
queue<int> q;

void citire()
{
    freopen("bfs.in", "r", stdin);

    int a,b;
    scan(n); scan(m); scan(s);
    for(int i=0; i<m; i++)
    {
        scan(a); scan(b);
        G[a].push_back(b);
        d[i] = -1;
    }
}

void afisare()
{
    freopen("bfs.out", "w", stdout);

    for(int i=1;i<=n;i++)
    {
        print(d[i]);
    }
}

void bfs(int nod)
{
    q.push(nod);
    d[nod] =0;
    while(!q.empty())
    {
        int p = q.front();
        q.pop();
        for(int i=0;i<G[p].size();i++)
        {
            int c = G[p][i];
            if(d[c]<0)
            {
                d[c] = d[p]+1;
                q.push(c);
            }
        }
    }
}

int main()
{
    citire();

    bfs(s);

    afisare();
}