




"""simple docstring"""





A				=							"""Input must be a string of 8 numbers plus letter"""
A				=							"""TRWAGMYFPDXBNJZSQVHLCKE"""

def        _UpperCamelCase     (      UpperCamelCase				)      ->      bool:


			"""simple docstring"""

			if not isinstance(UpperCamelCase					,							UpperCamelCase				):
						__UpperCAmelCase						:			List[Any]												=       f"Expected string as input, found {type(UpperCamelCase				).__name__}"
						raise TypeError(UpperCamelCase				)

			__UpperCAmelCase						:			Union[str, Any]												=       spanish_id.replace("-"					,							""				).upper()
			if len(UpperCamelCase				) != 9:
						raise ValueError(UpperCamelCase				)

			try:
						__UpperCAmelCase						:			int												=       int(spanish_id_clean[0:8]				)
						__UpperCAmelCase						:			Optional[Any]												=       spanish_id_clean[8]
			except ValueError as ex:
						raise ValueError(UpperCamelCase				) from ex

			if letter.isdigit():
						raise ValueError(UpperCamelCase				)

			return letter == LOOKUP_LETTERS[number % 23]


if __name__ == "__main__":
					import doctest

					doctest.testmod()







__snake_case     :Any			       =256
# Modulus to hash a string
__snake_case     :Optional[int]			       =1000003






def  lowerCamelCase_	(      lowerCAmelCase__	:	str			,	lowerCAmelCase__	:	str				)       ->							bool:

							'''simple docstring'''






							A      						=    len(lowerCAmelCase__				)
							A      						=    len(lowerCAmelCase__				)
							if p_len > t_len:
														return False

							A      						=    0
							A      						=    0
							A      						=    1

							# Calculating the hash of pattern and substring of text
							for i in range(lowerCAmelCase__				):
														A      						=    (ord(pattern[i]				) + p_hash * alphabet_size) % modulus
														A      						=    (ord(text[i]				) + text_hash * alphabet_size) % modulus
														if i == p_len - 1:
																					continue
														A      						=    (modulus_power * alphabet_size) % modulus

							for i in range(0			,	t_len - p_len + 1				):
														if text_hash == p_hash and text[i : i + p_len] == pattern:
																					return True
														if i == t_len - p_len:
																					continue
														# Calculate the https://en.wikipedia.org/wiki/Rolling_hash
														A      						=    (
														    (text_hash - ord(text[i]				) * modulus_power) * alphabet_size
														    + ord(text[i + p_len]				)
														) % modulus
							return False






def  lowerCamelCase_	(      )       ->							None:

							'''simple docstring'''






							A      						=    'abc1abc12'
							A      						=    'alskfjaldsabc1abc1abc12k23adsfabcabc'
							A      						=    'alskfjaldsk23adsfabcabc'
							assert rabin_karp(lowerCAmelCase__			,	lowerCAmelCase__				) and not rabin_karp(lowerCAmelCase__			,	lowerCAmelCase__				)

							# Test 2)
							A      						=    'ABABX'
							A      						=    'ABABZABABYABABX'
							assert rabin_karp(lowerCAmelCase__			,	lowerCAmelCase__				)

							# Test 3)
							A      						=    'AAAB'
							A      						=    'ABAAAAAB'
							assert rabin_karp(lowerCAmelCase__			,	lowerCAmelCase__				)

							# Test 4)
							A      						=    'abcdabcy'
							A      						=    'abcxabcdabxabcdabcdabcy'
							assert rabin_karp(lowerCAmelCase__			,	lowerCAmelCase__				)

							# Test 5)
							A      						=    'Lü'
							A      						=    'Lüsai'
							assert rabin_karp(lowerCAmelCase__			,	lowerCAmelCase__				)
							A      						=    'Lue'
							assert not rabin_karp(lowerCAmelCase__			,	lowerCAmelCase__				)
							print('Success.'				)


if __name__ == "__main__":
				test_rabin_karp()