
'''simple docstring'''






from __future__ import annotations







def 		A_       (	_lowerCAmelCase   :    list[int]				,	_lowerCAmelCase   :    int							):



      """simple docstring"""




      if len(_lowerCAmelCase							) < k or k < 0:
            raise ValueError("Invalid Input"							)
      _lowerCamelCase				:   Union[str, Any]								=   sum(array[:k]							)
      for i in range(len(_lowerCAmelCase							) - k							):
            _lowerCamelCase				:   Dict								=   current_sum - array[i] + array[i + k]
            _lowerCamelCase				:   Any								=   max(_lowerCAmelCase				,	_lowerCAmelCase							)
      return max_sum


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

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

'''simple docstring'''






def 		A_       (	_lowerCAmelCase   :    int							):



      """simple docstring"""




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

      if num == 0:
            return "0b0"

      _lowerCamelCase				:   Tuple								=   False

      if num < 0:
            _lowerCamelCase				:   List[Any]								=   True
            _lowerCamelCase				:   int								=   -num

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

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

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


if __name__ == "__main__":
 import doctest

 doctest.testmod()