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: def ans():
      tmp = -9999999999999
      N = int(input())
      F = [list(map(int, input().split())) for i in range(N)]
      P = [list(map(int, input().split())) for i in range(N)]
  
      def calculate(B):
          v = []
          for n in range(N):
              mcnt = 0
              for k in range(10):
                  if B[k] == "1" and F[n][k] == 1:
                      mcnt += 1
              v.append(P[n][mcnt])
          return sum(v)
  
      for i in range(1, 1 << 10):
          bi = bin(i)
          bi = bi[2:]
          bi = "0" * (10 - len(bi)) + bi
          tmp = max(tmp, calculate(bi))
      return print(tmp)
  
  
  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"}]