output_description: If S is coffee-like, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: K, N = map(int, input().split())
  N = N - 1
  A = list(map(int, input().split()))
  A_d = [A[i + 1] - A[i] for i in range(0, len(A) - 1)]
  A_d.append(K - A[-1] + A[0])
  print(A_d)
  A_d2 = (A_d + A_d[1:]) * 2
  print(A_d2)
  res = K
  for i in range(len(A_d2) - 1):
      if res > sum(A_d2[i : i + N]):
          res = sum(A_d2[i : i + N])
  print(res)
  
problem_description: Statement
  
  A string of length 6 consisting of lowercase English letters is said to be
  coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th
  and 6-th characters are also equal.  
  Given a string S, determine whether it is coffee-like.
samples: [{"input": "sippuu", "output": "Yes\n    \n\nIn `sippuu`, the 3-rd and 4-th characters are equal, and the 5-th and 6-th\ncharacters are also equal.\n\n* * *"}, {"input": "iphone", "output": "No\n    \n\n* * *"}, {"input": "coffee", "output": "Yes"}]