Problem: The warehouse in your shop has n shoe pairs. Each pair is characterized by two integers: its price ci and its size si. We know that on this very day all numbers si are different, that is, there is no more than one pair of each size.

The shop has m customers who came at the same time. The customer number i has di money and the size of his feet equals li. The customer number i can buy the pair number j, if cj ≤ di, and also if li = sj or li = sj - 1; that is, it is necessary that he has enough money to pay for the shoes. It is also necessary that the size of his feet equals to or is less by 1 than the size of the shoes he chooses.

Your task is to sell some customers pairs of shoes (a pair per person) so as to maximize the sum of the sold pairs cj that is, the profit. It is guaranteed that each customer buys no more than one pair and each pair will be bought by no more than one customer.

Input

The first input line contains the only integer n (1 ≤ n ≤ 105) — the number of shoe pairs in the warehouse. Then n lines contain the descriptions of pairs of shoes as two integers ci and si (1 ≤ ci, si ≤ 109), the numbers are separated by a space. It is guaranteed that all numbers si are different.

The next line contains an integer m (1 ≤ m ≤ 105) — the number of customers in the shop. Next m lines contain the customers' descriptions as two integers di and li (1 ≤ di, li ≤ 109), the numbers are separated by a space.

Output

In the first line print the only integer — the maximum profit you can get from selling shoes. In the second line print an integer k — the number of shoe pairs you will sell. In the following k lines print the descriptions of the sold pairs — two space-separated integers where the first number is the customer's number and the second number is the number of the shoes the customer will buy.

You can print pairs of numbers "the customer's number and the shoes' number" in any order, the customers and the pairs of shoes are numbered starting from 1 in the order in which they are given in the input. If there are several optimal answers, you are allowed to print any of them.

Please do not use the %lld specificator to read or write 64-bit numbers in С++. It is preferred to use the cin, cout streams or the %I64d specificator instead.

Examples

Input

3
10 1
30 2
20 3
2
20 1
20 2


Output

30
2
2 3
1 1


Input

3
10 4
20 5
30 6
2
70 4
50 5


Output

50
2
2 3
1 2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100010;
int n, m, sum;
long long F[MaxN][2][2];
int from[MaxN][2][2][3], used[MaxN][2][2];
struct node {
  int c, s, p;
} A[MaxN], B[MaxN];
bool cmp(node A, node B) { return A.s > B.s || (A.s == B.s && A.c > B.c); }
void init() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &A[i].c, &A[i].s);
    A[i].p = i;
  }
  cin >> m;
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d", &B[i].c, &B[i].s);
    B[i].p = i;
  }
  sort(A + 1, A + n + 1, cmp);
  sort(B + 1, B + m + 1, cmp);
}
void add(int i, int x, int y, int p1, int p2, int p3) {
  from[i][x][y][0] = p1;
  from[i][x][y][1] = p2;
  from[i][x][y][2] = p3;
}
void travel(int p1, int p2, int p3, int flag) {
  if (!p1 && !p2 && !p3) return;
  if (used[p1][p2][p3]) {
    if (!flag)
      ++sum;
    else
      printf("%d %d\n", B[p1].p, A[used[p1][p2][p3]].p);
  }
  travel(from[p1][p2][p3][0], from[p1][p2][p3][1], from[p1][p2][p3][2], flag);
}
void work() {
  long long ans = 0;
  int p1 = 0, p2 = 0, p3 = 0;
  int j = 1;
  for (int i = 1; i <= m; ++i) {
    while (A[j].s > B[i].s) {
      ++j;
      if (j > n) break;
    }
    if (B[i - 1].s == B[i].s) {
      F[i][0][0] = F[i - 1][0][0];
      add(i, 0, 0, i - 1, 0, 0);
      F[i][0][1] = F[i - 1][0][1];
      add(i, 0, 1, i - 1, 0, 1);
      F[i][1][0] = F[i - 1][1][0];
      add(i, 1, 0, i - 1, 1, 0);
      F[i][1][1] = F[i - 1][1][1];
      add(i, 1, 1, i - 1, 1, 1);
      if (B[i].c >= A[j - 1].c && A[j - 1].s == B[i].s + 1) {
        if (F[i][0][1] < F[i - 1][0][0] + A[j - 1].c) {
          F[i][0][1] = F[i - 1][0][0] + A[j - 1].c;
          used[i][0][1] = j - 1;
          add(i, 0, 1, i - 1, 0, 0);
        }
        if (F[i][1][1] < F[i - 1][1][0] + A[j - 1].c) {
          F[i][1][1] = F[i - 1][1][0] + A[j - 1].c;
          used[i][1][1] = j - 1;
          add(i, 1, 1, i - 1, 1, 0);
        }
      }
      if (B[i].c >= A[j].c && A[j].s == B[i].s) {
        if (F[i][1][0] < F[i - 1][0][0] + A[j].c) {
          F[i][1][0] = F[i - 1][0][0] + A[j].c;
          used[i][1][0] = j;
          add(i, 1, 0, i - 1, 0, 0);
        }
        if (F[i][1][1] < F[i - 1][0][1] + A[j].c) {
          F[i][1][1] = F[i - 1][0][1] + A[j].c;
          used[i][1][1] = j;
          add(i, 1, 1, i - 1, 0, 1);
        }
      }
    } else if (B[i - 1].s == B[i].s + 1) {
      if (F[i - 1][0][0] > F[i - 1][0][1]) {
        F[i][0][0] = F[i - 1][0][0];
        add(i, 0, 0, i - 1, 0, 0);
      } else {
        F[i][0][0] = F[i - 1][0][1];
        add(i, 0, 0, i - 1, 0, 1);
      }
      if (F[i - 1][1][0] > F[i - 1][1][1]) {
        F[i][0][1] = F[i - 1][1][0];
        add(i, 0, 1, i - 1, 1, 0);
      } else {
        F[i][0][1] = F[i - 1][1][1];
        add(i, 0, 1, i - 1, 1, 1);
      }
      if (B[i].c >= A[j - 1].c && A[j - 1].s == B[i].s + 1) {
        if (F[i][0][1] < max(F[i - 1][0][0], F[i - 1][0][1]) + A[j - 1].c) {
          if (F[i][0][1] < F[i - 1][0][0] + A[j - 1].c) {
            F[i][0][1] = F[i - 1][0][0] + A[j - 1].c;
            used[i][0][1] = j - 1;
            add(i, 0, 1, i - 1, 0, 0);
          }
          if (F[i][0][1] < F[i - 1][0][1] + A[j - 1].c) {
            F[i][0][1] = F[i - 1][0][1] + A[j - 1].c;
            used[i][0][1] = j - 1;
            add(i, 0, 1, i - 1, 0, 1);
          }
        }
      }
      if (B[i].c >= A[j].c && A[j].s == B[i].s) {
        if (F[i][1][0] < max(F[i - 1][0][0], F[i - 1][0][1]) + A[j].c) {
          if (F[i][1][0] < F[i - 1][0][0] + A[j].c) {
            F[i][1][0] = F[i - 1][0][0] + A[j].c;
            used[i][1][0] = j;
            add(i, 1, 0, i - 1, 0, 0);
          }
          if (F[i][1][0] < F[i - 1][0][1] + A[j].c) {
            F[i][1][0] = F[i - 1][0][1] + A[j].c;
            used[i][1][0] = j;
            add(i, 1, 0, i - 1, 0, 1);
          }
        }
        if (F[i][1][1] < max(F[i - 1][1][0], F[i - 1][1][1]) + A[j].c) {
          if (F[i][1][1] < F[i - 1][1][0] + A[j].c) {
            F[i][1][1] = F[i - 1][1][0] + A[j].c;
            used[i][1][1] = j;
            add(i, 1, 1, i - 1, 1, 0);
          }
          if (F[i][1][1] < F[i - 1][1][1] + A[j].c) {
            F[i][1][1] = F[i - 1][1][1] + A[j].c;
            used[i][1][1] = j;
            add(i, 1, 1, i - 1, 1, 1);
          }
        }
      }
    } else {
      for (int x = 0; x < 2; ++x)
        for (int y = 0; y < 2; ++y)
          if (F[i][0][0] < F[i - 1][x][y]) {
            F[i][0][0] = F[i - 1][x][y];
            add(i, 0, 0, i - 1, x, y);
          }
      if (B[i].c >= A[j - 1].c && A[j - 1].s == B[i].s + 1) {
        if (F[i][0][1] < F[i][0][0] + A[j - 1].c) {
          F[i][0][1] = F[i][0][0] + A[j - 1].c;
          used[i][0][1] = j - 1;
          add(i, 0, 1, i, 0, 0);
        }
      }
      if (B[i].c >= A[j].c && A[j].s == B[i].s) {
        if (F[i][1][0] < F[i][0][0] + A[j].c) {
          F[i][1][0] = F[i][0][0] + A[j].c;
          used[i][1][0] = j;
          add(i, 1, 0, i, 0, 0);
        }
      }
    }
    for (int x = 0; x < 2; ++x)
      for (int y = 0; y < 2; ++y)
        if (ans < F[i][x][y]) {
          ans = F[i][x][y];
          p1 = i;
          p2 = x;
          p3 = y;
        }
  }
  cout << ans << endl;
  sum = 0;
  travel(p1, p2, p3, 0);
  cout << sum << endl;
  travel(p1, p2, p3, 1);
}
int main() {
  init();
  work();
  return 0;
}