





'''simple docstring'''





import os
from math import logaa




def 	lowerCAmelCase_					(						__UpperCAmelCase:    List[str] = "base_exp.txt"   )   ->			int:
    UpperCamelCase__							:       Union[str, Any]      =   0
    UpperCamelCase__							:       int      =   0
    for i, line in enumerate(open(os.path.join(os.path.dirname(lowerCamelCase__   )	,     lowerCamelCase__   )   )   ):
        UpperCamelCase__     ,UpperCamelCase__							:       List[str]      =   list(map(lowerCamelCase__	,     line.split(''','''   )   )   )
        if x * logaa(lowerCamelCase__   ) > largest:
            UpperCamelCase__							:       List[Any]      =   x * logaa(lowerCamelCase__   )
            UpperCamelCase__							:       int      =   i + 1
    return result


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








from __future__ import annotations




def 	lowerCAmelCase_					(						__UpperCAmelCase:    str	,     __UpperCAmelCase:    str   )   ->			bool:
    UpperCamelCase__							:       List[str]      =   get_failure_array(__UpperCAmelCase   )

    # 2) Step through text searching for pattern
    UpperCamelCase__     ,UpperCamelCase__							:       Dict      =   0, 0  # index into text, pattern
    while i < len(__UpperCAmelCase   ):
        if pattern[j] == text[i]:
            if j == (len(__UpperCAmelCase   ) - 1):
                return True
            j += 1

        # if this is a prefix in our pattern
        # just go back far enough to continue
        elif j > 0:
            UpperCamelCase__							:       Optional[int]      =   failure[j - 1]
            continue
        i += 1
    return False




def 	lowerCAmelCase_					(						__UpperCAmelCase:    str   )   ->			list[int]:
    UpperCamelCase__							:       Union[str, Any]      =   [0]
    UpperCamelCase__							:       Tuple      =   0
    UpperCamelCase__							:       Tuple      =   1
    while j < len(__UpperCAmelCase   ):
        if pattern[i] == pattern[j]:
            i += 1
        elif i > 0:
            UpperCamelCase__							:       str      =   failure[i - 1]
            continue
        j += 1
        failure.append(__UpperCAmelCase   )
    return failure


if __name__ == "__main__":
  # Test 1)
  UpperCAmelCase_  							=				'abc1abc12'
  UpperCAmelCase_  							=				'alskfjaldsabc1abc1abc12k23adsfabcabc'
  UpperCAmelCase_  							=				'alskfjaldsk23adsfabcabc'
  assert kmp(pattern, texta) and not kmp(pattern, texta)

  # Test 2)
  UpperCAmelCase_  							=				'ABABX'
  UpperCAmelCase_  							=				'ABABZABABYABABX'
  assert kmp(pattern, text)

  # Test 3)
  UpperCAmelCase_  							=				'AAAB'
  UpperCAmelCase_  							=				'ABAAAAAB'
  assert kmp(pattern, text)

  # Test 4)
  UpperCAmelCase_  							=				'abcdabcy'
  UpperCAmelCase_  							=				'abcxabcdabxabcdabcdabcy'
  assert kmp(pattern, text)

  # Test 5)
  UpperCAmelCase_  							=				'aabaabaaa'
  assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]

