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 binarize(txt):
      xs = txt.split(" ")
      xs = [int(x) for x in xs]
      b = 0
      for i in range(10):
          b += xs[i] * (2**i)
      return b
  
  
  def count1(b):
      b = b[2:]
      count = 0
      for i in range(len(b)):
          if b[i] == "1":
              count += 1
      return count
  
  
  N = input()
  N = int(N)
  
  F = [0 for i in range(N)]
  
  for i in range(N):
      txt = input()
      F[i] = binarize(txt)
  
  
  P = [[] for i in range(N)]
  
  for i in range(N):
      xs = input().split(" ")
      P[i] = [int(x) for x in xs]
  
  
  m = -(10**11)
  
  for i in range(1, 2**10):
  
      score = 0
  
      for j in range(N):
          b = bin(i & F[j])
          count = count1(b)
          score += P[j][count]
  
      if score > m:
          m = score
  
  print(m)
  
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"}]