#include <iostream>
#include <fstream>
#include <vector>
#define nmax 100010
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, src, nr;
int cost [nmax], v[nmax], c[nmax];
vector<int>adj[nmax];

void BFS(int node)
{
    for (int i = 1; i <= n; ++i)
         cost[i] = -1;

    nr = 1;
    c[nr] = node;
    cost[node] = 0;

    for (int i = 1; i <= nr ; ++i)
        for(int j = 0; j < v[c[i]]; ++j)
        {
            if (cost[adj[c[i]][j]] == -1)
               {
                    c[++nr] = adj[c[i]][j];
                    cost[c[nr]] = cost[c[i]] + 1;
               }
        }
}

int main()
{
    fin >> n >> m >> src;
    for (int i = 0; i < m; ++i)
    {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
         v[i]=adj[i].size();
    BFS(src);
    for (int i = 1 ; i <= n; ++i)
        fout << cost[i] << ' ';
    return 0;
}