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])
1692B - All Distinct | 1156C - Match Points |
1675A - Food for Animals | 1328C - Ternary XOR |
1689A - Lex String | 1708B - Difference of GCDs |
863A - Quasi-palindrome | 1478A - Nezzar and Colorful Balls |
1581B - Diameter of Graph | 404A - Valera and X |
908A - New Year and Counting Cards | 146A - Lucky Ticket |
1594C - Make Them Equal | 1676A - Lucky |
1700B - Palindromic Numbers | 702C - Cellular Network |
1672C - Unequal Array | 1706C - Qpwoeirut And The City |
1697A - Parkway Walk | 1505B - DMCA |
478B - Random Teams | 1705C - Mark and His Unfinished Essay |
1401C - Mere Array | 1613B - Absent Remainder |
1536B - Prinzessin der Verurteilung | 1699B - Almost Ternary Matrix |
1545A - AquaMoon and Strange Sort | 538B - Quasi Binary |
424A - Squats | 1703A - YES or YES |