t = int(input())
s = []
for i in range(t):
cost = input()
cost = cost.split(' ')
for j in range(len(cost)):
cost[j] = int(cost[j])
cost.sort()
r = 0
l = 0
n = int(input())
for j in range(n):
y = list(input())
r += int(y[0])
l += int(y[2])
if r > l:
r = r * int(cost[0])
l = l * int(cost[1])
else:
r = r * int(cost[1])
l = l * int(cost[0])
a = l + r
s.append(a)
for i in range(len(s)):
print(s[i])
1350A - Orac and Factors | 1373A - Donut Shops |
26A - Almost Prime | 1656E - Equal Tree Sums |
1656B - Subtract Operation | 1656A - Good Pairs |
1367A - Short Substrings | 87A - Trains |
664A - Complicated GCD | 1635D - Infinite Set |
1462A - Favorite Sequence | 1445B - Elimination |
1656C - Make Equal With Mod | 567A - Lineland Mail |
1553A - Digits Sum | 1359B - New Theatre Square |
766A - Mahmoud and Longest Uncommon Subsequence | 701B - Cells Not Under Attack |
702A - Maximum Increase | 1656D - K-good |
1426A - Floor Number | 876A - Trip For Meal |
1326B - Maximums | 1635C - Differential Sorting |
961A - Tetris | 1635B - Avoid Local Maximums |
20A - BerOS file system | 1637A - Sorting Parts |
509A - Maximum in Table | 1647C - Madoka and Childish Pranks |