output_description: Print the maximum number of coins you can get.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: N, K = [int(c) for c in input().split()]
  S = [int(c) for c in input()]
  
  longest = 0
  
  for bgn_flip in range(len(S)):
  
      S_copy = S[:]
      zero = False
      icluster = -1
      for i, s in enumerate(S):
          if s == 0 and zero == False:
              zero = True
              icluster += 1
          if s == 1:
              zero = False
  
          if s == 0 and icluster >= bgn_flip and icluster < bgn_flip + K:
              S_copy[i] = 1
  
      seq = 0
      for sc in S_copy:
          if sc == 1:
              seq += 1
          if sc == 0:
              seq = 0
          if seq > longest:
              longest = seq
  
  print(longest)
  
problem_description: Statement
  
  There are two buttons, one of size A and one of size B.
  
  When you press a button of size X, you get X coins and the size of that button
  decreases by 1.
  
  You will press a button twice. Here, you can press the same button twice, or
  press both buttons once.
  
  At most how many coins can you get?
samples: [{"input": "5 3", "output": "9\n    \n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this\nis the maximum result.\n\n* * *"}, {"input": "3 4", "output": "7\n    \n\n* * *"}, {"input": "6 6", "output": "12"}]