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 JAVA):

Solution:
import static java.util.Arrays.sort;

import java.io.*;
import java.util.*;

public class D {

	private static void solve() throws IOException {
		int shoesCount = nextInt();
		Shoe[] shoes = new Shoe[shoesCount];
		for (int i = 0; i < shoesCount; i++) {
			int cost = nextInt(), size = nextInt();
			shoes[i] = new Shoe(size, cost, i);
		}
		sort(shoes);

		TreeMap<Integer, List<Customer>> customers = new TreeMap<Integer, List<Customer>>();
		int costomersCount = nextInt();
		for (int i = 0; i < costomersCount; i++) {
			int cost = nextInt(), size = nextInt();
			add(customers, size, new Customer(cost, i));
		}

		RestoreInfo[] info = new RestoreInfo[shoesCount + 1];
		RestoreInfo[] maxSuffix = new RestoreInfo[shoesCount + 1];
		info[shoesCount] = new RestoreInfo(0);
		maxSuffix[shoesCount] = info[shoesCount];
		int shoeIndex = shoesCount;

		for (Map.Entry<Integer, List<Customer>> entry : customers.descendingMap().entrySet()) {
			int size = entry.getKey();
			List<Customer> list = entry.getValue();
			Collections.sort(list, new Comparator<Customer>() {
				@Override
				public int compare(Customer o1, Customer o2) {
					return o1.money - o2.money;
				}
			});

			if (list.size() > 2) {
				list.subList(0, list.size() - 2).clear();
			}

			while (shoeIndex > 0 && shoes[shoeIndex - 1].size >= size) {
				--shoeIndex;
				maxSuffix[shoeIndex] = max(maxSuffix[shoeIndex + 1], info[shoeIndex]);
			}

			int shoeHave = -1;
			for (int i = 0; i < 2; i++) {
				int index = shoeIndex + i;
				if (index < 0 || index >= shoesCount) {
					continue;
				}
				if (shoes[index].size != size && shoes[index].size != size + 1) {
					continue;
				}
				Customer man = list.get(list.size() - 1);
				if (man.money < shoes[index].cost) {
					continue;
				}
				if (shoeHave == -1) {
					shoeHave = index;
				} else {
					shoeHave = -2;
				}
				RestoreInfo have = maxSuffix[index + 1];
				long profitMake = have.profitMake + shoes[index].cost;
				RestoreInfo willHave = new RestoreInfo(profitMake, shoes[index].id, man.id, have);
				info[index] = max(info[index], willHave);
				for (int j = index; j >= shoeIndex; --j) {
					maxSuffix[j] = max(maxSuffix[j], willHave);
				}
			}

			if (shoeHave == -2 && list.size() == 2) {
				Shoe one = shoes[shoeIndex], two = shoes[shoeIndex + 1];
				if (one.cost > two.cost) {
					Shoe t = one;
					one = two;
					two = t;
				}
				Customer manOne = list.get(0), manTwo = list.get(1);
				if (one.cost <= manOne.money && two.cost <= manTwo.money) {
					RestoreInfo have = maxSuffix[shoeIndex + 2];
					long profitMake = have.profitMake + one.cost + two.cost;
					RestoreInfo willHave1 = new RestoreInfo(have.profitMake + two.cost, two.id,
							manTwo.id, have);
					RestoreInfo willHave = new RestoreInfo(profitMake, one.id, manOne.id, willHave1);
					info[shoeIndex] = max(info[shoeIndex], willHave);
					maxSuffix[shoeIndex] = max(maxSuffix[shoeIndex], willHave);
				}
			}
		}
		RestoreInfo answer = maxSuffix[shoeIndex];
		List<Integer> shoesRestore = new ArrayList<Integer>();
		List<Integer> customersRestore = new ArrayList<Integer>();
		long answerMoney = answer.profitMake;
		while (answer.nextShoe != null) {
			shoesRestore.add(answer.thisShoe);
			customersRestore.add(answer.thisMan);
			answer = answer.nextShoe;
		}
		out.println(answerMoney);
		out.println(shoesRestore.size());
		for (int i = 0; i < shoesRestore.size(); i++) {
			out.print(customersRestore.get(i) + 1);
			out.print(' ');
			out.print(shoesRestore.get(i) + 1);
			out.println();
		}
	}

	static RestoreInfo max(RestoreInfo one, RestoreInfo two) {
		if (one == null) {
			return two;
		}
		if (two == null) {
			return one;
		}
		if (one.profitMake <= two.profitMake) {
			return two;
		} else {
			return one;
		}
	}

	static class RestoreInfo {
		long profitMake;
		int thisShoe;
		int thisMan;
		RestoreInfo nextShoe;

		private RestoreInfo(long profitMake, int thisShoe, int thisMan, RestoreInfo nextShoe) {
			this.profitMake = profitMake;
			this.thisShoe = thisShoe;
			this.nextShoe = nextShoe;
			this.thisMan = thisMan;
		}

		private RestoreInfo(long profitMake) {
			this.profitMake = profitMake;
			this.thisShoe = -1;
			this.thisMan = -1;
			this.nextShoe = null;
		}
	}

	static class Shoe implements Comparable<Shoe> {
		final int size, cost, id;

		private Shoe(int size, int cost, int id) {
			this.size = size;
			this.cost = cost;
			this.id = id;
		}

		@Override
		public int compareTo(Shoe o) {
			return size - o.size;
		}
	}

	static <K, T> void add(Map<K, List<T>> map, K key, T value) {
		List<T> list = map.get(key);
		if (list == null) {
			list = new ArrayList<T>();
			map.put(key, list);
		}
		list.add(value);
	}

	static class Customer {
		final int money;
		final int id;

		private Customer(int size, int id) {
			this.money = size;
			this.id = id;
		}

	}

	public static void main(String[] args) {
		try {
			br = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			solve();
			out.close();
		} catch (Throwable e) {
			e.printStackTrace();
			System.exit(239);
		}
	}

	static BufferedReader br;
	static StringTokenizer st;
	static PrintWriter out;

	static String nextToken() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String line = br.readLine();
			if (line == null) {
				return null;
			}
			st = new StringTokenizer(line);
		}
		return st.nextToken();
	}

	static int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
}