
import re





def     _a					(						lowerCamelCase							):
 lowerCamelCase		:	Optional[int]							=      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(_lowercase,	_lowercase							)							)


if __name__ == "__main__":
      _lowerCamelCase					   ="""0094702343221"""

      print(is_sri_lankan_phone_number(phone))









"""simple docstring"""
from __future__ import annotations

from collections import Counter
from random import random
class 				lowerCamelCase  :






					'''simple docstring'''





					def __init__(       self:							Tuple						)   ->	Optional[Any]:
											snake_case_ :Optional[int]						=			{}






					def    lowerCAmelCase_				(       self:							Dict						,     snake_case:							str						)   ->	None:
											snake_case_ :str						=			{}






					def    lowerCAmelCase_				(       self:							Optional[int]						,     snake_case:							str						,     snake_case:							str						,     snake_case:							float						)   ->	None:
											if nodea not in self.connections:
																	self.add_node(snake_case						)
											if nodea not in self.connections:
																	self.add_node(snake_case						)
											snake_case_ :Dict						=			probability






					def    lowerCAmelCase_				(       self:							List[Any]						)   ->	list[str]:
											return list(self.connections						)






					def    lowerCAmelCase_				(       self:							Any						,     snake_case:							str						)   ->	str:
											snake_case_ :Optional[Any]						=			0
											snake_case_ :List[str]						=			random()

											for dest in self.connections[node]:
																	current_probability += self.connections[node][dest]
																	if current_probability > random_value:
																							return dest
											return ""

def    A_  (			_lowercase,					_lowercase,					_lowercase	):







						'''simple docstring'''


						snake_case_ :List[str]						=			MarkovChainGraphUndirectedUnweighted()

						for nodea, nodea, probability in transitions:
												graph.add_transition_probability(_lowercase,					_lowercase,					_lowercase	)

						snake_case_ :int						=			Counter(graph.get_nodes()	)
						snake_case_ :Optional[Any]						=			start

						for _ in range(_lowercase	):
												snake_case_ :Tuple						=			graph.transition(_lowercase	)
												visited[node] += 1

						return visited


if __name__ == "__main__":
						import doctest

						doctest.testmod()
