output_description: When the minimum fee is x yen, print the value of x.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B
attempt: n = int(input())
  F = [[0] * 10 for i in range(n)]
  for i in range(n):
      F[i] = list(map(int, input().split()))
  P = [[0] * 11 for i in range(n)]
  for i in range(n):
      P[i] = list(map(int, input().split()))
  ans = -(10**10)
  for i in range(1, 1024):
      s = format(i, "12b")
      A = []
      for j in range(10):
          if s[-1 - j] == "1":
              A.append(j)
      p = 0
      for j in range(n):
          c = sum(F[j][A[k]] for k in range(len(A)))
          p = p + P[j][c]
      if p > ans:
          ans = p
  print(ans)
  
problem_description: Statement
  
  You are parking at a parking lot. You can choose from the following two fee
  plans:
  
    * Plan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.
    * Plan 2: The fee will be B yen, regardless of the duration.
  
  Find the minimum fee when you park for N hours.
samples: [{"input": "7 17 120", "output": "119\n    \n\n  * If you choose Plan 1, the fee will be 7\u00d717=119 yen.\n  * If you choose Plan 2, the fee will be 120 yen.\n\nThus, the minimum fee is 119 yen.\n\n* * *"}, {"input": "5 20 100", "output": "100\n    \n\nThe fee might be the same in the two plans.\n\n* * *"}, {"input": "6 18 100", "output": "100"}]