/// bfs infoarena
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <sstream>
#include <cstring>
#define NMax 100001
///#define f cin
///#define g cout
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector<int> G[NMax];
queue<int > q;
int n, x, y, m, start, L[NMax];
bool viz[NMax];

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

int main()
{
    f >> n >> m >> start;
    for(int i = 0; i < m; ++i)
    {
        f >> x >> y;
        G[x].push_back(y);
    }
    memset(L, -1, sizeof(L));
    bfs(start);

    for(int i = 1; i <= n; ++i)
        g << L[i] << " ";
    return 0;
}