output_description: Print the maximum number of consecutive rainy days in the period.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: X, K, D = list(map(int, input().split()))
  
  
  def sgn(x):
      if x > 0:
          return 1
      elif x < 0:
          return -1
      return 0
  
  
  def solve():
      if X > 0:
          x_greedy = X - K * D
      elif X < 0:
          x_greedy = X + K * D
  
      if sgn(X) == sgn(x_greedy):
          return print(abs(x_greedy))
  
      else:
          x_r = X % D
          x_l = x_r - D
  
          r_parity = (abs(X - x_r) // D) % 2
          if K % 2 == r_parity:
              return print(abs(x_r))
          else:
              return print(abs(x_l))
  
  
  if __name__ == "__main__":
      solve()
  
problem_description: Statement
  
  We have weather records at AtCoder Town for some consecutive three days. A
  string of length 3, S, represents the records - if the i-th character is `S`,
  it means it was sunny on the i-th day; if that character is `R`, it means it
  was rainy on that day.
  
  Find the maximum number of consecutive rainy days in this period.
samples: [{"input": "RRS", "output": "2\n    \n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number\nof consecutive rainy days is 2, so we should print 2.\n\n* * *"}, {"input": "SSS", "output": "0\n    \n\nIt was sunny throughout the period. We had no rainy days, so we should print\n0.\n\n* * *"}, {"input": "RSR", "output": "1\n    \n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we\nshould print 1."}]