#include <fstream>
#include <cstring>
#include <vector>
#include <queue>
#define N 100005
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, l, s;
vector<int> A[N];
int G[N], S[N], Cost[N];

void BFS(int start)
{
    memset(Cost, -1, sizeof(Cost));
    l = 1;
    Cost[start] = 0;
    S[l] = start;

    for(int i = 1; i <= l; i++)
        for(int j = 0; j < G[S[i]]; j++)
            if(Cost[A[S[i]][j]] == -1)
            {
                S[++l] = A[S[i]][j];
                Cost[S[l]] = Cost[S[i]] + 1;
            }
}

int main()
{
    int x, y;
    fin >> n >> m >> s;

    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        A[x].push_back(y);
    }

    for(int i = 1; i <= N; i++)
        G[i] = A[i].size();

    BFS(s);

    for(int i = 1; i <= n; i++)
        fout << Cost[i] << " ";

    return 0;
}