Problem: Professor GukiZ has two arrays of integers, a and b. Professor wants to make the sum of the elements in the array a sa as close as possible to the sum of the elements in the array b sb. So he wants to minimize the value v = |sa - sb|.

In one operation professor can swap some element from the array a and some element from the array b. For example if the array a is [5, 1, 3, 2, 4] and the array b is [3, 3, 2] professor can swap the element 5 from the array a and the element 2 from the array b and get the new array a [2, 1, 3, 2, 4] and the new array b [3, 3, 5].

Professor doesn't want to make more than two swaps. Find the minimal value v and some sequence of no more than two swaps that will lead to the such value v. Professor makes swaps one by one, each new swap he makes with the new arrays a and b.

Input

The first line contains integer n (1 ≤ n ≤ 2000) — the number of elements in the array a.

The second line contains n integers ai ( - 109 ≤ ai ≤ 109) — the elements of the array a.

The third line contains integer m (1 ≤ m ≤ 2000) — the number of elements in the array b.

The fourth line contains m integers bj ( - 109 ≤ bj ≤ 109) — the elements of the array b.

Output

In the first line print the minimal value v = |sa - sb| that can be got with no more than two swaps.

The second line should contain the number of swaps k (0 ≤ k ≤ 2).

Each of the next k lines should contain two integers xp, yp (1 ≤ xp ≤ n, 1 ≤ yp ≤ m) — the index of the element in the array a and the index of the element in the array b in the p-th swap.

If there are several optimal solutions print any of them. Print the swaps in order the professor did them.

Examples

Input

5
5 4 3 2 1
4
1 1 1 1


Output

1
2
1 1
4 2


Input

5
1 2 3 4 5
1
15


Output

0
0


Input

5
1 2 3 4 5
4
1 2 3 4


Output

1
1
3 1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int l1, l2;
long long a[2048 + 10], b[2048 + 10];
long long s1, s2;
int len;
struct Node {
  int a, b;
  long long c;
} node[4000000 + 10];
bool cmp(const Node &a, const Node &b) { return a.c < b.c; }
int query(long long x) {
  int l = 0, r = len - 1;
  int pos = 0;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (node[mid].c < x) {
      l = mid + 1;
      pos = l;
    } else {
      r = mid;
      pos = r;
    }
  }
  return pos;
}
int main() {
  while (scanf("%d", &l1) != EOF) {
    s1 = s2 = 0;
    int i;
    pair<int, int> ans1, ans2;
    for (i = 0; i < l1; i++) scanf("%I64d", &a[i]), s1 += a[i];
    scanf("%d", &l2);
    for (i = 0; i < l2; i++) scanf("%I64d", &b[i]), s2 += b[i];
    long long ans = abs(s1 - s2);
    int j;
    int k = 0;
    for (i = 0; i < l1; i++) {
      for (j = 0; j < l2; j++) {
        long long tmp = abs(s1 - 2LL * a[i] + 2LL * b[j] - s2);
        if (tmp < ans) {
          k = 1;
          ans = tmp;
          ans1 = {i, j};
        }
      }
    }
    len = 0;
    for (i = 0; i < l1; i++) {
      for (j = i + 1; j < l1; j++) {
        node[len].a = i;
        node[len].b = j;
        node[len].c = 2LL * (a[i] + a[j]);
        len++;
      }
    }
    sort(node, node + len, cmp);
    if (len) {
      for (i = 0; i < l2; i++) {
        for (j = i + 1; j < l2; j++) {
          long long tmp = s1 - s2 + 2LL * (b[i] + b[j]);
          int id = query(tmp);
          if (id < len) {
            if (abs(tmp - node[id].c) < ans) {
              ans = abs(tmp - node[id].c);
              ans1 = {node[id].a, node[id].b};
              ans2 = {i, j};
              k = 2;
            }
          }
          if (id - 1 >= 0) {
            id--;
            if (abs(tmp - node[id].c) < ans) {
              ans = abs(tmp - node[id].c);
              ans1 = {node[id].a, node[id].b};
              ans2 = {i, j};
              k = 2;
            }
          }
        }
      }
    }
    printf("%I64d\n", ans);
    printf("%d\n", k);
    if (k == 2) {
      printf("%d %d\n", ans1.first + 1, ans2.first + 1);
      printf("%d %d\n", ans1.second + 1, ans2.second + 1);
    } else if (k == 1) {
      printf("%d %d\n", ans1.first + 1, ans1.second + 1);
    }
  }
  return 0;
}