

'''simple docstring'''






from __future__ import annotations


def 	_A  (					A__  ,       A__   ):






 """simple docstring"""



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


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

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





'''simple docstring'''






import re


def 	_A  (					A__   ):






 """simple docstring"""



 __lowercase													=				re.compile(
     R'''^(?:0|94|\+94|0{2}94)''' R'''7(0|1|2|4|5|6|7|8)''' R'''(-| |)''' R'''\d{7}$'''   )

 return bool(re.search(A__  ,       A__   )   )


if __name__ == "__main__":
 lowerCAmelCase__      		=			'''0094702343221'''

 print(is_sri_lankan_phone_number(phone))

