


def    a   (							A__      ,    A__							)	-> list:




      '''simple docstring'''

      SCREAMING_SNAKE_CASE__       :  int						     =		len(A__							)
      SCREAMING_SNAKE_CASE__       :  int						     =		[]
      for i in range(len(A__							) - pat_len + 1							):
            SCREAMING_SNAKE_CASE__       :  Any						     =		True
            for j in range(A__							):
                  if s[i + j] != pattern[j]:
                        SCREAMING_SNAKE_CASE__       :  Any						     =		False
                        break
            if match_found:
                  position.append(A__							)
      return position


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










from ..utils import DummyObject, requires_backends






class    _UpperCamelCase     (       metaclass=__snake_case					):

				"""simple docstring"""







				lowerCAmelCase					=			['note_seq']

				def __init__(    self					, *a__					, **a__ )						->					Optional[int]:
					requires_backends(self					, ["""note_seq"""] )

				@classmethod
				def   _UpperCAmelCase       (    cls					, *a__					, **a__ )						->					Dict:
					requires_backends(cls					, ["""note_seq"""] )

				@classmethod
				def   _UpperCAmelCase       (    cls					, *a__					, **a__ )						->					Optional[int]:
					requires_backends(cls					, ["""note_seq"""] )



