#include <fstream>
#include <vector>
#include <queue>
#define MAX 100001
using namespace std;

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

vector<int> v[MAX];
int dist[MAX];

void BFS(int nod)
{
    dist[nod] = 0;
    queue<int> q;
    q.push(nod);
    while(!q.empty())
    {
        int nodNou = q.front();
        q.pop();
        for(int i=0;i<v[nodNou].size();i++)
        {
            int next = v[nodNou][i];
            if (dist[next] == -1) {
                q.push(next);
                dist[next] = dist[nodNou] + 1;
            }
        }
    }
}

int main()
{
    int n, m, s;
    fin >> n >> m >> s;
    for(int i=0;i<m;i++)
    {
        int x, y; fin >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        dist[i] = -1;
    BFS(s);
    for (int i = 1; i <= n; i++)
        fout << dist[i] << " ";
    return 0;
}