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

#define NMAX 100009    // numar maxim de noduri
#define kInf (1 << 30)

class Task {
public:
  void solve() {
    read_input();
    print_output(get_result());
  }
private:
  int n, m;
  vector<int> adj[NMAX];  // indexare de la 1

  int source;

  void read_input() {
    ifstream fin("bfs.in");
    fin >> n >> m >> source;

    for (int i = 1; i <= m; ++i) {
        int x, y;
        fin >> x >> y;

        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    fin.close();
  }
  vector<int> get_result() {
    
    return do_bfs();
  }

  vector<int> do_bfs() {

    vector<int> d(n + 1); // vector de distante

    queue<int> Q;

    for (int i = 1; i <= n; ++i) {
      d[i] = kInf;      // presupun ca nu am drum
    }

    Q.push(source);
    d[source] = 0;

    while (!Q.empty()) {
      int node = Q.front();
      Q.pop();

      for (auto &it : adj[node]) {
        if (d[node] + 1 < d[it]) {
          d[it] = d[node] + 1;

          Q.push(it);
        }
      }
    }
    for (auto &x : d) {
		if (x == kInf) {
			x = -1;
		}
	}
    return d;
  }
  void print_output(vector<int> result) {
        ofstream fout("bfs.out");
        for (int i = 1; i <= n; i++) {
            fout << result[i] << (i == n ? '\n' : ' ');
        }
        fout.close();
    }
};
int main() {
  Task *task = new Task();
  task->solve();
  delete task;

  return 0;
}