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

using namespace std;

const int MAX = 100050;

vector<int> v[MAX];
queue<int> q;
int af[MAX];

void prepare()
{
    for(int i = 0; i < MAX; i++) af[i] = -1;
}

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int n, m, x, a, b, actual;
    prepare();
    scanf("%d %d %d", &n, &m, &x); q.push(x); af[x] = 0;
    for(int i = 1; i <= m; i++){scanf("%d %d", &a, &b); v[a].push_back(b);} fclose(stdin);
    while(!q.empty())
    {
        actual = q.front(); q.pop();
        for(size_t i = 0; i < v[actual].size(); i++)
            if(af[v[actual][i]] < 0)
            {
                af[v[actual][i]] = af[actual] + 1;
                q.push(v[actual][i]);
            }
    }
    for(int i = 1; i <= n; i++)
        printf("%d ", af[i]);
    fclose(stdout);
    return 0;
}