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

#define NMax 100000

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

void hamilton(int G[NMax][NMax], int s, int accessible[], int prev[], int n, int m)
{
    int dist[NMax];
    for(int i = 1; i <= n; i++)
        dist[i] = -1;
    vector<int> q;
    vector<int> visited;
    q.push_back(s);
    visited.push_back(s);
    dist[s] = 0;
    while(!q.empty())
    {
        int x = q.back();
        q.pop_back();
        for(int i = 1; i <= n; i++)
        {
            if(G[x][i] == 1)
            {
                if(find(visited.begin(), visited.end(), i) == visited.end())
                {
                    q.push_back(i);
                    visited.push_back(i);
                    dist[i] = dist[x] + 1;
                    prev[i] = x;
                }
            }
        }
    }
    //for(size_t i = 0; i < visited.size(); i++)
    //   fout << visited[i] << " ";
    for(int i = 1; i <= n; i++)
        fout << dist[i] << " ";
};

int main()
{
    int G[NMax][NMax], s, prev[NMax], n, m, x, y;
    int accessible[NMax];
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        G[x][y] = 1;
    }
    hamilton(G, s, accessible, prev, n, m);
    return 0;
}