
import os
from math import logaa


def 				A	( lowercase = "base_exp.txt"			)       ->  int:
		'''simple docstring'''

		UpperCamelCase          =					0
		UpperCamelCase          =					0
		for i, line in enumerate(open(os.path.join(os.path.dirname(lowercase			)   ,	lowercase			)			)			):
				UpperCamelCase     ,  UpperCamelCase          =					list(map(lowercase   ,	line.split(','			)			)			)
				if x * logaa(lowercase			) > largest:
						UpperCamelCase          =					x * logaa(lowercase			)
						UpperCamelCase          =					i + 1
		return result


if __name__ == "__main__":
						print(solution())


from __future__ import annotations


class     lowercase :



		def __init__(			self    ,				A_    ,				A_	)  -> Any:
				"""simple docstring"""
				UpperCamelCase     ,  UpperCamelCase          =					text, pattern
				UpperCamelCase     ,  UpperCamelCase          =					len(A_	), len(A_	)



		def __UpperCamelCase			(			self    ,				A_	)  -> int:
				"""simple docstring"""

				for i in range(self.patLen - 1    ,				-1    ,				-1	):
						if char == self.pattern[i]:
								return i
				return -1



		def __UpperCamelCase			(			self    ,				A_	)  -> int:
				"""simple docstring"""

				for i in range(self.patLen - 1    ,				-1    ,				-1	):
						if self.pattern[i] != self.text[current_pos + i]:
								return current_pos + i
				return -1



		def __UpperCamelCase			(			self	)  -> list[int]:
				"""simple docstring"""
				# searches pattern in text and returns index positions
				UpperCamelCase          =					[]
				for i in range(self.textLen - self.patLen + 1	):
						UpperCamelCase          =					self.mismatch_in_text(A_	)
						if mismatch_index == -1:
								positions.append(A_	)
						else:
								UpperCamelCase          =					self.match_in_pattern(self.text[mismatch_index]	)
								UpperCamelCase          =					(
								    mismatch_index - match_index
								)  # shifting index lgtm [py/multiple-definition]
				return positions






_UpperCAmelCase :			Union[str, Any]              =	"ABAABA"
_UpperCAmelCase :			Any              =	"AB"
_UpperCAmelCase :			Dict              =	BoyerMooreSearch(text, pattern)
_UpperCAmelCase :			Optional[int]              =	bms.bad_character_heuristic()

if len(positions) == 0:
					print("No match found")
else:
					print("Pattern found in following positions: ")
					print(positions)
