
"""simple docstring"""
def 					__lowerCamelCase       (							a_					:		str			,       a_					:		str							)      ->				list:
      __SCREAMING_SNAKE_CASE       :str		    =  len(lowercase__							)
      __SCREAMING_SNAKE_CASE       :Dict		    =  []
      for i in range(len(lowercase__							) - pat_len + 1							):
            __SCREAMING_SNAKE_CASE       :str		    =  True
            for j in range(lowercase__							):
                  if s[i + j] != pattern[j]:
                        __SCREAMING_SNAKE_CASE       :str		    =  False
                        break
            if match_found:
                  position.append(lowercase__							)
      return position


if __name__ == "__main__":
  assert naive_pattern_search("ABCDEFG", "DE") == [3]
  print(naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC"))






"""simple docstring"""
def 					__lowerCamelCase       (							a_					:		int			,       a_					:		int							)      ->				int:
      return int((input_a, input_a).count(0							) == 0							)



def 					__lowerCamelCase       (							)      ->				None:
      assert and_gate(0			,       0							) == 0
      assert and_gate(0			,       1							) == 0
      assert and_gate(1			,       0							) == 0
      assert and_gate(1			,       1							) == 1


if __name__ == "__main__":
  test_and_gate()
  print(and_gate(1, 0))
  print(and_gate(0, 0))
  print(and_gate(0, 1))
  print(and_gate(1, 1))