#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

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

vector <int> v[100001];
int n, m, s, viz[100001], dist[100001]={-1};
queue <int> q;

void bfs(int nod) {
    int cnt = 0;
    q.push(nod);
    while (!q.empty()) {
        for (int i = 0; i < v[nod].size(); i++) {
            int fiu = v[nod][i];
            q.push(fiu);
        }
        q.pop();
        dist[nod] = cnt;
        cnt++;
        viz[nod] = 1;
        nod = q.front();
    }
}

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