comefrom: <doocs>1566.Detect Pattern of Length M Repeated K or More Times_1.py
code: def containsPattern( arr: List[int], m: int, k: int) -> bool:
      n = len(arr)
      for i in range(n - m * k + 1):
          j = 0
          while j < m * k:
              if arr[i + j] != arr[i + (j % m)]:
                  break
              j += 1
          if j == m * k:
              return True
      return False
masked: def sample_funcname ( var_0 : List [ int ] , var_3 : int , var_4 : int ) -> bool :
      var_7 = len ( var_0 )
      for var_10 in range ( var_7 - var_3 * var_4 + 1 ) :
          var_12 = 0
          while var_12 < var_3 * var_4 :
              if var_0 [ var_10 + var_12 ] != var_0 [ var_10 + ( var_12 % var_3 ) ] :
                  break
              var_12 += 1
          if var_12 == var_3 * var_4 :
              return True
      return False
  