#include <bits/stdc++.h>
using namespace std;
const int maxn = 25;
const int inf = 0x3f3f3f3f;
int x[maxn], y[maxn];
int n;
int pre[1 << maxn], dis[maxn][maxn], dp[1 << maxn];
int stk[maxn], cnt;
int main() {
  scanf("%d%d", &x[0], &y[0]);
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x[i], &y[i]);
  }
  for (int i = 0; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
      dis[i][j] = dis[j][i] =
          (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
    }
  }
  memset(dp, 0x3f, sizeof dp);
  dp[0] = 0;
  pre[0] = 0;
  for (int i = 0; i < (1 << n); i++) {
    if (dp[i] == inf) continue;
    for (int j = 1; j <= n; j++) {
      if (i & (1 << (j - 1))) continue;
      for (int k = 1; k <= n; k++) {
        if (i & (1 << (k - 1))) continue;
        if (dp[i] + dis[0][j] + dis[j][k] + dis[k][0] <
            dp[i | (1 << (j - 1)) | (1 << (k - 1))]) {
          dp[i | (1 << (j - 1)) | (1 << (k - 1))] =
              dp[i] + dis[0][j] + dis[j][k] + dis[k][0];
          pre[i | (1 << (j - 1)) | (1 << (k - 1))] = i;
        }
      }
      break;
    }
  }
  printf("%d\n", dp[(1 << n) - 1]);
  stk[++cnt] = 0;
  for (int i = (1 << n) - 1; i != 0; i = pre[i]) {
    int tmp = i ^ pre[i];
    for (int j = 1; j <= n; j++) {
      if (tmp & (1 << (j - 1))) stk[++cnt] = j;
    }
    stk[++cnt] = 0;
  }
  while (cnt) printf("%d ", stk[cnt--]);
  printf("\n");
  return 0;
}
