PROGRAMMING:Magic coupons
There's a magic shop on Mars that offers magic coupons. Each coupon is printed with an integer face value K, which means that if you use this coupon when you buy a product, you can get a return of K times the value of the product! The store also gives away some valuable goods for free, but if you use a coupon with a positive face value when receiving the free gifts, you must pay the store K times the value of the goods... But don't worry, there are also coupons with a negative face value（ It's amazing Mars)
For example, given a group of coupons, the face values are 1, 2, 4, - 1; Corresponding to a group of goods, the value is m $7,6, - 2, - 3, of which the negative value means that the goods are free gifts. We can use coupon 3 on commodity 1 and get m $28 in return; Coupon 2 is used on commodity 2 to get m $12 in return; Coupon 4 is used on commodity 4 and gets M $3 in return. But if you accidentally use coupon 3 on Item 4, you have to pay m $12 to the store. Similarly, when you accidentally use coupon 4 on Item 1, you have to pay m $7 to the store.
It is stipulated that each coupon and product can only be used once at most, so as to maximize the return you can get.
###Input format:
There are two lines of input. The first line first gives the number of coupons n, and then gives the integer face value of N coupons. The second line first gives the number of commodities m, and then gives the integer value of M commodities. N and m are between [1, $$10 ^ 6 $$], all data size is no more than $$2 ^ {30} $$, and numbers are separated by spaces.
###Output format:
The maximum return you can get from the output.
###Input example:
```in
4 1 2 4 -1
4 7 6 -2 -3
```
###Output example:
```out
forty-three
```
answer：If there is no answer, please comment
For example, given a group of coupons, the face values are 1, 2, 4, - 1; Corresponding to a group of goods, the value is m $7,6, - 2, - 3, of which the negative value means that the goods are free gifts. We can use coupon 3 on commodity 1 and get m $28 in return; Coupon 2 is used on commodity 2 to get m $12 in return; Coupon 4 is used on commodity 4 and gets M $3 in return. But if you accidentally use coupon 3 on Item 4, you have to pay m $12 to the store. Similarly, when you accidentally use coupon 4 on Item 1, you have to pay m $7 to the store.
It is stipulated that each coupon and product can only be used once at most, so as to maximize the return you can get.
###Input format:
There are two lines of input. The first line first gives the number of coupons n, and then gives the integer face value of N coupons. The second line first gives the number of commodities m, and then gives the integer value of M commodities. N and m are between [1, $$10 ^ 6 $$], all data size is no more than $$2 ^ {30} $$, and numbers are separated by spaces.
###Output format:
The maximum return you can get from the output.
###Input example:
```in
4 1 2 4 -1
4 7 6 -2 -3
```
###Output example:
```out
forty-three
```
answer：If there is no answer, please comment