




'''simple docstring'''





def      UpperCamelCase_(	snake_case							:       Dict							,				snake_case							:       List[Any]							,				snake_case							:       int = 0							,				snake_case							:       Dict = 0     ):

							'''simple docstring'''






							snake_case_						=      right or len(_SCREAMING_SNAKE_CASE     ) - 1
							if left > right:
														return -1
							elif list_data[left] == key:
														return left
							elif list_data[right] == key:
														return right
							else:
														return search(_SCREAMING_SNAKE_CASE							,				_SCREAMING_SNAKE_CASE							,				left + 1							,				right - 1     )


if __name__ == "__main__":
		import doctest

		doctest.testmod()










def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> list:
       lowerCamelCase   :      Dict			 =					len(_SCREAMING_SNAKE_CASE    )
       lowerCamelCase   :      Union[str, Any]			 =					[]
       for i in range(len(_SCREAMING_SNAKE_CASE    ) - pat_len + 1    ):
              lowerCamelCase   :      Dict			 =					True
              for j in range(_SCREAMING_SNAKE_CASE    ):
                     if s[i + j] != pattern[j]:
                            lowerCamelCase   :      Optional[int]			 =					False
                            break
              if match_found:
                     position.append(_SCREAMING_SNAKE_CASE    )
       return position


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






