




'''simple docstring'''





def      UpperCamelCase_(	snake_case							:       int							,				snake_case							:       Optional[int]     ):

							'''simple docstring'''






							snake_case_						=      len(_SCREAMING_SNAKE_CASE     )
							snake_case_						=      []
							for i in range(len(_SCREAMING_SNAKE_CASE     ) - pat_len + 1     ):
														snake_case_						=      True
														for j in range(_SCREAMING_SNAKE_CASE     ):
																					if s[i + j] != pattern[j]:
																												snake_case_						=      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"))










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'))






