


"""simple docstring"""

import logging

from transformers import PretrainedConfig


UpperCAmelCase__					=logging.getLogger(__name__)


UpperCAmelCase__					={
    "bertabs-finetuned-cnndm": "https://huggingface.co/remi/bertabs-finetuned-cnndm-extractive-abstractive-summarization/resolve/main/config.json",
}





class  lowerCamelCase__    (		_a     ):
      a			:  str           =		"""bertabs"""
      def __init__(		self						:						Optional[int]   ,							A_						:						List[str]=3_0_5_2_2   ,							A_						:						str=5_1_2   ,							A_						:						Tuple=6   ,							A_						:						int=5_1_2   ,							A_						:						Dict=8   ,							A_						:						Dict=5_1_2   ,							A_						:						Optional[Any]=0.2   ,							A_						:						Optional[Any]=6   ,							A_						:						List[str]=7_6_8   ,							A_						:						Union[str, Any]=8   ,							A_						:						str=2_0_4_8   ,							A_						:						Optional[Any]=0.2   ,							**A_						:						Optional[Any]   ,							):






       '''simple docstring'''


       super().__init__(**A_				)

       __lowercase						=						vocab_size
       __lowercase						=						max_pos

       __lowercase						=						enc_layers
       __lowercase						=						enc_hidden_size
       __lowercase						=						enc_heads
       __lowercase						=						enc_ff_size
       __lowercase						=						enc_dropout

       __lowercase						=						dec_layers
       __lowercase						=						dec_hidden_size
       __lowercase						=						dec_heads
       __lowercase						=						dec_ff_size
       __lowercase						=						dec_dropout




"""simple docstring"""

def lowerCAmelCase_   (					UpperCamelCase__						:			Union[str, Any]					, UpperCamelCase__						:			Union[str, Any]					, UpperCamelCase__						:			int			):






 """simple docstring"""







 if n == 0:
  return 1

 elif n % 2 == 1:
  return (binary_exponentiation(UpperCamelCase__					, n - 1					, UpperCamelCase__			) * a) % mod

 else:
  __lowercase						=						binary_exponentiation(UpperCamelCase__					, n / 2					, UpperCamelCase__			)
  return (b * b) % mod


# a prime number
UpperCAmelCase__					=701

UpperCAmelCase__					=10_0000_0000
UpperCAmelCase__					=10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)

print((a / b) % p == (a * b ** (p - 2)) % p)
