#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 100005;

int n, m, s, i, x, y, d[nmax];

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

void bfs(int source)
{
    d[source] = 1;
    q.push(source);

    while(!q.empty())
    {
        x = q.front();
        q.pop();

        for(auto it : v[x])
            if(!d[it])
            {
                d[it] = d[x] + 1;
                q.push(it);
            }
    }

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

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

    scanf("%d%d%d", &n, &m, &s);

    for(; m; m--)
    {
        scanf("%d%d", &x, &y);
        v[x].pb(y);
    }

    bfs(s);

    return 0;
}