output_description: Let v_d be the satisfaction at the end of day d. Print D integers v_d to
  Standard Output in the following format:
  
      
      
      v_1
      v_2
      \vdots
      v_D
      
  
  * * *
input_description: Input is given from Standard Input in the form of the input of Problem A
  followed by the output of Problem A.
  
      
      
      D
      c_1 c_2 \cdots c_{26}
      s_{1,1} s_{1,2} \cdots s_{1,26}
      \vdots
      s_{D,1} s_{D,2} \cdots s_{D,26}
      t_1
      t_2
      \vdots
      t_D
      
  
    * The constraints and generation methods for the input part are the same as those for Problem A.
    * For each d, t_d is an integer satisfying 1\leq t_d \leq 26, and your program is expected to work correctly for any value that meets the constraints.
attempt: s = [input() for i in range(2)]
  l0 = int(s[0])
  l1 = list(map(int, s[1].split()))
  l1all = sum(l1)
  t = [input() for i in range(l0)]
  for i in range(l0):
      l2 = list(map(int, t[i].split()))
  sowa = 0
  u = [input() for i in range(l0)]
  for i in range(l0):
      l3 = int(u[i])
      # print("l3:",l3,",l2[",l3-1,"]:",l2[l3-1],",l1all:",l1all,",l1[",l3-1,"]:",l1[l3-1])
      sowa += l2[l3 - 1]
      sowa -= l1all
      sowa += l1[l3 - 1]
      # print("l3:",l3-1,",l2[l3]:",l2[l3-1],",l1all:",l1all,",l1[l3]:",l1[l3-1])
      print(sowa)
  
problem_description: Statement
  
  You will be given a contest schedule for D days. For each d=1,2,\ldots,D,
  calculate the satisfaction at the end of day d.
  
  * * *
samples: [{"input": "5\n    86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n    19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n    6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n    6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n    8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n    19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n    1\n    17\n    13\n    14\n    13", "output": "18398\n    35037\n    51140\n    65837\n    79325\n    \n\nNote that this example is a small one for checking the problem specification.\nIt does not satisfy the constraint D=365 and is never actually given as a test\ncase."}]