#include <bits/stdc++.h>
using namespace std;

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

int bfs(vector<vector<int>>& adj, int target) {
    int nodes = adj.size();
    vector<bool> visited(nodes, false);

    queue<pair<int, int>> q;
    
    visited[0] = true;
    q.push({0, 0});

    while (!q.empty()) {
        auto curr = q.front();
        q.pop();

        for (int x : adj[curr.first]) {
            if (x == target) {
                return curr.second;
            }
            if (!visited[x]) {
                visited[x] = true;
                q.push({x, curr.second + 1});
            }
        }
    }
    
    return -1;
}

int main() {
    int n;
    int m;
    int s;
    fin >> n >> m >> s;
    vector<vector<int>> adj;

    int x, y;
    while (m--) {
        fin >> x >> y;
        adj.push_back({x, y}); 
    }

    for (int i = 0; i < n; ++i) {
        fout << bfs(adj, s) << ' ';
    }

    return 0;
}