


import random


class 	_a							:

							@staticmethod
							def 				lowerCamelCase_			(							UpperCamelCase_:     str							)      ->       tuple[list[int], list[int]]:





									"""simple docstring"""







									lowercase__						=				[ord(UpperCamelCase_							) for i in text]
									lowercase__						=				[]
									lowercase__						=				[]
									for i in plain:
											lowercase__						=				random.randint(1   ,						300							)
											lowercase__						=				(i + k) * k
											cipher.append(UpperCamelCase_							)
											key.append(UpperCamelCase_							)
									return cipher, key


							@staticmethod
							def 				lowerCamelCase_			(							UpperCamelCase_:     list[int]   ,						UpperCamelCase_:     list[int]							)      ->       str:





									"""simple docstring"""







									lowercase__						=				[]
									for i in range(len(UpperCamelCase_							)							):
											lowercase__						=				int((cipher[i] - (key[i]) ** 2) / key[i]							)
											plain.append(chr(UpperCamelCase_							)							)
									return "".join(UpperCamelCase_							)


if __name__ == "__main__":
			lowerCAmelCase,						lowerCAmelCase	=							Onepad().encrypt('Hello')
			print(c, k)
			print(Onepad().decrypt(c, k))






def       _a			(				SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




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


