Problem: Girl Lena likes it when everything is in order, and looks for order everywhere. Once she was getting ready for the University and noticed that the room was in a mess — all the objects from her handbag were thrown about the room. Of course, she wanted to put them back into her handbag. The problem is that the girl cannot carry more than two objects at a time, and cannot move the handbag. Also, if he has taken an object, she cannot put it anywhere except her handbag — her inherent sense of order does not let her do so.

You are given the coordinates of the handbag and the coordinates of the objects in some Сartesian coordinate system. It is known that the girl covers the distance between any two objects in the time equal to the squared length of the segment between the points of the objects. It is also known that initially the coordinates of the girl and the handbag are the same. You are asked to find such an order of actions, that the girl can put all the objects back into her handbag in a minimum time period.

Input

The first line of the input file contains the handbag's coordinates xs, ys. The second line contains number n (1 ≤ n ≤ 24) — the amount of objects the girl has. The following n lines contain the objects' coordinates. All the coordinates do not exceed 100 in absolute value. All the given positions are different. All the numbers are integer.

Output

In the first line output the only number — the minimum time the girl needs to put the objects into her handbag. 

In the second line output the possible optimum way for Lena. Each object in the input is described by its index number (from 1 to n), the handbag's point is described by number 0. The path should start and end in the handbag's point. If there are several optimal paths, print any of them. 

Examples

Input

0 0
2
1 1
-1 1


Output

8
0 1 2 0 


Input

1 1
3
4 3
3 4
0 0


Output

32
0 1 2 0 3 0 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 25;
inline int getDis(pair<int, int> a, pair<int, int> b) {
  return (b.first - a.first) * (b.first - a.first) +
         (b.second - a.second) * (b.second - a.second);
}
pair<int, int> G[maxn];
int dp[1 << maxn];
int dis[maxn][maxn], route[1 << maxn];
int n;
int main() {
  scanf("%d%d", &G[0].first, &G[0].second);
  scanf("%d", &n);
  for (register int i = 1; i <= n; i++)
    scanf("%d%d", &G[i].first, &G[i].second);
  for (register int i = 0; i <= n; i++)
    for (register int j = i; j <= n; j++)
      dis[i][j] = dis[j][i] = getDis(G[i], G[j]);
  memset(route, -1, sizeof route);
  for (register int i = 0; i < (1 << maxn); i++) dp[i] = 0x3f3f3f3f;
  dp[0] = 0;
  for (register int i = 0; i < (1ll << n); i++) {
    if (dp[i] == 0x3f3f3f3f) continue;
    for (register int j = 1; j <= n; j++) {
      if (i & (1ll << (j - 1))) continue;
      for (register int k = 1; k <= n; k++) {
        if (i & (1ll << (k - 1))) continue;
        if (dp[i] + dis[0][j] + dis[j][k] + dis[k][0] <
            dp[i | (1ll << (j - 1)) | (1ll << (k - 1))]) {
          route[i | (1ll << (j - 1) | (1ll << (k - 1)))] = i;
          dp[i | (1ll << (j - 1)) | (1ll << (k - 1))] =
              min(dp[i | (1ll << (j - 1)) | (1ll << (k - 1))],
                  dp[i] + dis[0][j] + dis[j][k] + dis[k][0]);
        }
      }
      break;
    }
  }
  printf("%d\n", dp[(1 << n) - 1]);
  int now = (1 << n) - 1, last = -1;
  printf("0 ");
  while (true) {
    if (last == -1) {
      last = now;
      now = route[now];
      continue;
    } else {
      int change = now ^ last;
      for (register int i = 1; i <= n; i++) {
        if (change & (1ll << (i - 1))) {
          printf("%d ", i);
        }
      }
      last = now;
      now = route[now];
      if (now == -1) {
        for (register int i = 1; i <= n; i++) {
          if (last & (1 << (i - 1))) {
            printf("%d ", i);
          }
        }
        break;
      }
    }
    printf("0 ");
  }
  printf("0");
  return 0;
}