#include <bits/stdc++.h>
using namespace std;
int n;
int dp[(1 << 24) + 1];
int path[(1 << 24) + 1][2];
int locs[25][2];
int dists[25][25];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  for (int i = 0; i < (1 << 24); i++) {
    dp[i] = INT_MAX;
  }
  int input1, input2;
  cin >> locs[0][0] >> locs[0][1];
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> locs[i][0] >> locs[i][1];
  }
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      dists[i][j] = (locs[i][0] - locs[j][0]) * (locs[i][0] - locs[j][0]) +
                    (locs[i][1] - locs[j][1]) * (locs[i][1] - locs[j][1]);
    }
  }
  int mask = 0;
  dp[mask] = 0;
  while (mask < (1 << n)) {
    if (dp[mask] == INT_MAX) {
      mask++;
      continue;
    }
    for (int i = 0; i < n; i++) {
      if (((mask >> i) & 1) == 1) continue;
      for (int j = i; j < n; j++) {
        if (((mask >> j) & 1) == 1) continue;
        int x = mask | 1 << i | 1 << j;
        int y =
            dists[0][i + 1] + dists[i + 1][j + 1] + dists[j + 1][0] + dp[mask];
        if (dp[x] > y) {
          if (i == j)
            path[x][0] = i + 1, path[x][1] = 0;
          else
            path[x][0] = i + 1, path[x][1] = j + 1;
          dp[x] = y;
        }
      }
      break;
    }
    mask++;
  }
  mask--;
  cout << dp[mask] << "\n";
  while (mask > 0) {
    cout << "0 " << path[mask][0] << " ";
    if (path[mask][1]) {
      cout << path[mask][1] << " ";
      mask = mask ^ (1 << (path[mask][0] - 1)) ^ (1 << (path[mask][1] - 1));
    } else
      mask = mask ^ (1 << (path[mask][0] - 1));
  }
  cout << "0\n";
  return 0;
}
