





def    __UpperCamelCase      (    a) ->str:

					if isinstance(a,     a):
										raise TypeError("'float' object cannot be interpreted as an integer")
					if isinstance(a,     a):
										raise TypeError("'str' object cannot be interpreted as an integer")

					if num == 0:
										return "0b0"

					lowerCamelCase__       =       False

					if num < 0:
										lowerCamelCase__       =       True
										lowerCamelCase__       =       -num

					lowerCamelCase__       =       []
					while num > 0:
										binary.insert(0,     num % 2)
										num >>= 1

					if negative:
										return "-0b" + "".join(str(a) for e in binary)

					return "0b" + "".join(str(a) for e in binary)


if __name__ == "__main__":
						import doctest

						doctest.testmod()








from __future__ import annotations

class SCREAMING_SNAKE_CASE_ :





					"""simple docstring"""


					def __init__( self	,  _lowerCAmelCase	,  _lowerCAmelCase	):
										lowerCamelCase__    ,		lowerCamelCase__       =       text, pattern
										lowerCamelCase__    ,		lowerCamelCase__       =       len(_lowerCAmelCase	), len(_lowerCAmelCase	)





					def 					__magic_name__ ( self	,  _lowerCAmelCase	):

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





					def 					__magic_name__ ( self	,  _lowerCAmelCase	):

										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 					__magic_name__ ( self	):
										# searches pattern in text and returns index positions
										lowerCamelCase__       =       []
										for i in range(self.textLen - self.patLen + 1	):
															lowerCamelCase__       =       self.mismatch_in_text(_lowerCAmelCase	)
															if mismatch_index == -1:
																				positions.append(_lowerCAmelCase	)
															else:
																				lowerCamelCase__       =       self.match_in_pattern(self.text[mismatch_index]	)
																				lowerCamelCase__       =       (
																				    mismatch_index - match_index
																				)  # shifting index lgtm [py/multiple-definition]
										return positions

A_												=     "ABAABA"
A_												=     "AB"
A_												=     BoyerMooreSearch(text, pattern)
A_												=     bms.bad_character_heuristic()

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

