






from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


__UpperCAmelCase     							=						{
    'configuration_megatron_bert': ['MEGATRON_BERT_PRETRAINED_CONFIG_ARCHIVE_MAP', 'MegatronBertConfig'],
}

try:
		if not is_torch_available():
				raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
		pass
else:
		__UpperCAmelCase     							=						[
		    'MEGATRON_BERT_PRETRAINED_MODEL_ARCHIVE_LIST',
		    'MegatronBertForCausalLM',
		    'MegatronBertForMaskedLM',
		    'MegatronBertForMultipleChoice',
		    'MegatronBertForNextSentencePrediction',
		    'MegatronBertForPreTraining',
		    'MegatronBertForQuestionAnswering',
		    'MegatronBertForSequenceClassification',
		    'MegatronBertForTokenClassification',
		    'MegatronBertModel',
		    'MegatronBertPreTrainedModel',
		]

if TYPE_CHECKING:
		from .configuration_megatron_bert import MEGATRON_BERT_PRETRAINED_CONFIG_ARCHIVE_MAP, MegatronBertConfig

		try:
				if not is_torch_available():
						raise OptionalDependencyNotAvailable()
		except OptionalDependencyNotAvailable:
				pass
		else:
				from .modeling_megatron_bert import (
				    MEGATRON_BERT_PRETRAINED_MODEL_ARCHIVE_LIST,
				    MegatronBertForCausalLM,
				    MegatronBertForMaskedLM,
				    MegatronBertForMultipleChoice,
				    MegatronBertForNextSentencePrediction,
				    MegatronBertForPreTraining,
				    MegatronBertForQuestionAnswering,
				    MegatronBertForSequenceClassification,
				    MegatronBertForTokenClassification,
				    MegatronBertModel,
				    MegatronBertPreTrainedModel,
				)

else:
		import sys

		__UpperCAmelCase     							=						_LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)














from __future__ import annotations




def 					lowercase__				(					__snake_case   :							list[int]					,	__snake_case   :							int  ):


					'''simple docstring'''


					if len(__snake_case  ) < k or k < 0:
										raise ValueError('Invalid Input'  )
					UpperCAmelCase_   :				int						=						sum(array[:k]  )
					for i in range(len(__snake_case  ) - k  ):
										UpperCAmelCase_   :				List[Any]						=						current_sum - array[i] + array[i + k]
										UpperCAmelCase_   :				List[Any]						=						max(__snake_case					,	__snake_case  )
					return max_sum


if __name__ == "__main__":
		from doctest import testmod
		from random import randint

		testmod()
		__UpperCAmelCase     							=						[randint(-1000, 1000) for i in range(100)]
		__UpperCAmelCase     							=						randint(0, 110)
		print(F'The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}')






