output_description: Print the number of children standing on each square after the children
  performed the moves, in order from left to right.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: N, K = map(int, input().split())
  A = list(map(int, input().split()))
  
  
  def get_divisors(n):
      from math import ceil
  
      divisors = []
      for num in range(ceil(n**0.5), n + 1):
          if n % num == 0:
              divisors.append(n // num)
              if n // num != n:
                  divisors.append(num)
      divisors.sort(reverse=True)
      return divisors
  
  
  total = sum(A)
  divisors = get_divisors(total)
  ans = -1
  for d in divisors:
      R = [a % d for a in A]
      R.sort(reverse=True)
      pr = 0
      nr = -sum(R)
      for i, r in enumerate(R):
          pr += d - r
          nr += r
          if nr + pr >= 0:
              if pr <= K and nr + pr == 0:
                  ans = d
              break
      if ans != -1:
          print(ans)
          break
  else:
      print(1)
  
problem_description: Statement
  
  Given is a string S consisting of `L` and `R`.
  
  Let N be the length of S. There are N squares arranged from left to right, and
  the i-th character of S from the left is written on the i-th square from the
  left.
  
  The character written on the leftmost square is always `R`, and the character
  written on the rightmost square is always `L`.
  
  Initially, one child is standing on each square.
  
  Each child will perform the move below 10^{100} times:
  
    * Move one square in the direction specified by the character written in the square on which the child is standing. `L` denotes left, and `R` denotes right.
  
  Find the number of children standing on each square after the children
  performed the moves.
samples: [{"input": "RRLRL", "output": "0 1 2 1 1\n    \n\n  * After each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n  * After each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n  * After each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\n* * *"}, {"input": "RRLLLLRLRRLL", "output": "0 3 3 0 0 0 1 1 0 2 2 0\n    \n\n* * *"}, {"input": "RRRLLRLLRRRLLLLL", "output": "0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0"}]