output_description: Print the number of possible passwords.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: N, K = map(int, input().split())
  S = list(input())
  
  p = 0
  while K > 0 and p < len(S):
      now = S[p]
      p += 1
      if p >= len(S):
          break
      while now == S[p]:
          p += 1
          if p >= len(S):
              break
  
      q = p + 1
      if q >= len(S):
          """
          if S[p] == "R":
                  S[p] = "L"
          else:
                  S[p] = "R"
          """
          break
      while S[p] == S[q]:
          q += 1
          if q >= len(S):
              break
      while p < q:
          if S[p] == "R":
              S[p] = "L"
          else:
              S[p] = "R"
          p += 1
          if p >= len(S):
              break
      K -= 1
  
  ret = 0
  print(len(S))
  for x in range(len(S) - 1):
      print(x)
      if S[x] == S[x + 1]:
          ret += 1
  print(ret)
  
problem_description: Statement
  
  Takahashi is going to set a 3-character password.
  
  How many possible passwords are there if each of its characters must be a
  digit between 1 and N (inclusive)?
samples: [{"input": "2", "output": "8\n    \n\nThere are eight possible passwords: `111`, `112`, `121`, `122`, `211`, `212`,\n`221`, and `222`.\n\n* * *"}, {"input": "1", "output": "1\n    \n\nThere is only one possible password if you can only use one kind of character."}]