#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector<int>ma[100001];
int dist[100001];
queue<int>q;

void BFS()
{
    while (!q.empty())
    {
        int nod_curent = q.front();
        q.pop();
        for (int i = 0; i < ma[nod_curent].size(); i++)
        {
            int vecin = ma[nod_curent][i];
            if (dist[vecin] == -1)
            {
                dist[vecin] = dist[nod_curent] + 1;
                q.push(vecin);
            }
        }
    }
}

int main()
{
    int n, m, e;
    fin >> n >> m >> e;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        ma[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
    {
        dist[i] = -1;
    }

    q.push(e);
    dist[e] = 0;

    BFS();

    for (int i = 1; i <= n; i++)
    {
        fout << dist[i] << " ";
    }

    fin.close();
    fout.close();
    return 0;
}