




'''simple docstring'''

def __UpperCAmelCase	(   _UpperCAmelCase		:   str		,				_UpperCAmelCase		:   str						)      ->      list:
			__snake_case			=		len(_UpperCAmelCase						)
			__snake_case			=		[]
			for i in range(len(_UpperCAmelCase						) - pat_len + 1						):
						__snake_case			=		True
						for j in range(_UpperCAmelCase						):
									if s[i + j] != pattern[j]:
												__snake_case			=		False
												break
						if match_found:
									position.append(_UpperCAmelCase						)
			return position


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










from __future__ import annotations

import numpy as np

def        __a			(   __lowerCAmelCase   )     ->     Optional[Any]:
					return np.maximum(0      ,	__lowerCAmelCase   )


if __name__ == "__main__":
			print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]