


'''simple docstring'''




import os
from shutil import copyfile
from typing import Optional, Tuple

from ...file_utils import is_sentencepiece_available
from ...tokenization_utils_fast import PreTrainedTokenizerFast
from ...utils import logging


if is_sentencepiece_available():
				from .tokenization_deberta_va import DebertaVaTokenizer
else:
				__lowercase	:   Optional[Any]   		=					None

__lowercase	:   List[Any]   		=					logging.get_logger(__name__)

__lowercase	:   List[str]   		=					{"""vocab_file""": """spm.model""", """tokenizer_file""": """tokenizer.json"""}

__lowercase	:   Union[str, Any]   		=					{
    """vocab_file""": {
        """microsoft/deberta-v2-xlarge""": """https://huggingface.co/microsoft/deberta-v2-xlarge/resolve/main/spm.model""",
        """microsoft/deberta-v2-xxlarge""": """https://huggingface.co/microsoft/deberta-v2-xxlarge/resolve/main/spm.model""",
        """microsoft/deberta-v2-xlarge-mnli""": (
            """https://huggingface.co/microsoft/deberta-v2-xlarge-mnli/resolve/main/spm.model"""
        ),
        """microsoft/deberta-v2-xxlarge-mnli""": (
            """https://huggingface.co/microsoft/deberta-v2-xxlarge-mnli/resolve/main/spm.model"""
        ),
    }
}

__lowercase	:   Tuple   		=					{
    """microsoft/deberta-v2-xlarge""": 5_12,
    """microsoft/deberta-v2-xxlarge""": 5_12,
    """microsoft/deberta-v2-xlarge-mnli""": 5_12,
    """microsoft/deberta-v2-xxlarge-mnli""": 5_12,
}

__lowercase	:   Any   		=					{
    """microsoft/deberta-v2-xlarge""": {"""do_lower_case""": False},
    """microsoft/deberta-v2-xxlarge""": {"""do_lower_case""": False},
    """microsoft/deberta-v2-xlarge-mnli""": {"""do_lower_case""": False},
    """microsoft/deberta-v2-xxlarge-mnli""": {"""do_lower_case""": False},
}





class _snake_case (			a__ ):
							"""simple docstring"""





							__a				       =  VOCAB_FILES_NAMES
							__a				       =  PRETRAINED_VOCAB_FILES_MAP
							__a				       =  PRETRAINED_INIT_CONFIGURATION
							__a				       =  PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
							__a				       =  DebertaVaTokenizer







							def __init__( self      ,					__A=None      ,					__A=None      ,					__A=False      ,					__A=False      ,					__A="[CLS]"      ,					__A="[SEP]"      ,					__A="[UNK]"      ,					__A="[SEP]"      ,					__A="[PAD]"      ,					__A="[CLS]"      ,					__A="[MASK]"      ,					**__A      ,					)  ->None:



											"""simple docstring"""







											super().__init__(
											    __A      ,					tokenizer_file=__A      ,					do_lower_case=__A      ,					bos_token=__A      ,					eos_token=__A      ,					unk_token=__A      ,					sep_token=__A      ,					pad_token=__A      ,					cls_token=__A      ,					mask_token=__A      ,					split_by_punct=__A      ,					**__A      ,					)

											__lowerCamelCase		:   Any           =       do_lower_case
											__lowerCamelCase		:   Any           =       split_by_punct
											__lowerCamelCase		:   List[str]           =       vocab_file
											__lowerCamelCase		:   Any           =       False if not self.vocab_file else True







							def 		__SCREAMING_SNAKE_CASE( self      ,					__A      ,					__A=None						)  ->Optional[int]:



											"""simple docstring"""







											if token_ids_a is None:
															return [self.cls_token_id] + token_ids_a + [self.sep_token_id]
											__lowerCamelCase		:   str           =       [self.cls_token_id]
											__lowerCamelCase		:   Optional[Any]           =       [self.sep_token_id]
											return cls + token_ids_a + sep + token_ids_a + sep







							def 		__SCREAMING_SNAKE_CASE( self      ,					__A      ,					__A=None      ,					__A=False						)  ->int:



											"""simple docstring"""







											if already_has_special_tokens:
															return super().get_special_tokens_mask(
															    token_ids_a=__A      ,					token_ids_a=__A      ,					already_has_special_tokens=__A						)

											if token_ids_a is not None:
															return [1] + ([0] * len(__A						)) + [1] + ([0] * len(__A						)) + [1]
											return [1] + ([0] * len(__A						)) + [1]







							def 		__SCREAMING_SNAKE_CASE( self      ,					__A      ,					__A=None						)  ->Dict:



											"""simple docstring"""







											__lowerCamelCase		:   str           =       [self.sep_token_id]
											__lowerCamelCase		:   str           =       [self.cls_token_id]
											if token_ids_a is None:
															return len(cls + token_ids_a + sep						) * [0]
											return len(cls + token_ids_a + sep						) * [0] + len(token_ids_a + sep						) * [1]







							def 		__SCREAMING_SNAKE_CASE( self      ,					__A      ,					__A = None						)  ->Tuple[str]:



											"""simple docstring"""







											if not self.can_save_slow_tokenizer:
															raise ValueError(
															    "Your fast tokenizer does not have the necessary information to save the vocabulary for a slow "
															    "tokenizer."						)

											if not os.path.isdir(__A						):
															logger.error(f'Vocabulary path ({save_directory}) should be a directory'						)
															return
											__lowerCamelCase		:   List[str]           =       os.path.join(
											    __A      ,					(filename_prefix + "-" if filename_prefix else "") + VOCAB_FILES_NAMES["vocab_file"]						)

											if os.path.abspath(self.vocab_file						) != os.path.abspath(__A						):
															copyfile(self.vocab_file      ,					__A						)

											return (out_vocab_file,)









'''simple docstring'''




from collections import deque





def 				a_							(    lowercase     )      ->Tuple:






				'''simple docstring'''

				return input(lowercase     ).strip().split(" "     )





def 				a_							(    lowercase				,    lowercase     )      ->dict[int, list[int]]:






				'''simple docstring'''

				__lowerCamelCase		:   dict[int, list[int]]           =       {}
				for i in range(lowercase     ):
								__lowerCamelCase		:   int           =       []

				for e in range(lowercase     ):
								__lowerCamelCase    ,       __lowerCamelCase		:   int           =       (int(lowercase     ) for i in _input(F'Edge {e + 1}: <node1> <node2> '     ))
								graph[x].append(lowercase     )
				return graph





def 				a_							(    lowercase				,    lowercase     )      ->dict[int, list[int]]:






				'''simple docstring'''

				__lowerCamelCase		:   dict[int, list[int]]           =       {}
				for i in range(lowercase     ):
								__lowerCamelCase		:   Any           =       []

				for e in range(lowercase     ):
								__lowerCamelCase    ,       __lowerCamelCase		:   Dict           =       (int(lowercase     ) for i in _input(F'Edge {e + 1}: <node1> <node2> '     ))
								graph[x].append(lowercase     )
								graph[y].append(lowercase     )
				return graph





def 				a_							(    lowercase				,    lowercase     )      ->dict[int, list[tuple[int, int]]]:






				'''simple docstring'''

				__lowerCamelCase		:   dict[int, list[tuple[int, int]]]           =       {}
				for i in range(lowercase     ):
								__lowerCamelCase		:   List[Any]           =       []

				for e in range(lowercase     ):
								__lowerCamelCase    ,       __lowerCamelCase    ,       __lowerCamelCase		:   int           =       (int(lowercase     ) for i in _input(F'Edge {e + 1}: <node1> <node2> <weight> '     ))
								graph[x].append((y, w)     )
								graph[y].append((x, w)     )
				return graph


if __name__ == "__main__":
				__lowercase		,		__lowercase	:   List[Any]   		=					(int(i) for i in _input("""Number of nodes and edges: """))

				__lowercase	:   Any   		=					int(
				    _input(
				        """Press 1 or 2 or 3 \n"""
				        """1. Unweighted directed \n"""
				        """2. Unweighted undirected \n"""
				        """3. Weighted undirected \n"""
				    )[0]
				)

				__lowercase	:   Any   		=					{
				    1: initialize_unweighted_directed_graph,
				    2: initialize_unweighted_undirected_graph,
				    3: initialize_weighted_undirected_graph,
				}[graph_choice](n, m)





def 				a_							(    lowercase				,    lowercase     )      ->Tuple:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase		:   Dict           =       {s}, [s]
				print(lowercase     )
				while _s:
								__lowerCamelCase		:   int           =       0
								for i in g[_s[-1]]:
												if i not in vis:
																_s.append(lowercase     )
																vis.add(lowercase     )
																__lowerCamelCase		:   Tuple           =       1
																print(lowercase     )
																break
								if not flag:
												_s.pop()





def 				a_							(    lowercase				,    lowercase     )      ->List[str]:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase		:   Tuple           =       {s}, deque([s]     )
				print(lowercase     )
				while q:
								__lowerCamelCase		:   Optional[Any]           =       q.popleft()
								for v in g[u]:
												if v not in vis:
																vis.add(lowercase     )
																q.append(lowercase     )
																print(lowercase     )





def 				a_							(    lowercase				,    lowercase     )      ->Any:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase    ,       __lowerCamelCase		:   Optional[int]           =       {s: 0}, set(), {s: 0}
				while True:
								if len(lowercase     ) == len(lowercase     ) - 1:
												break
								__lowerCamelCase		:   str           =       10_0000
								for i in dist:
												if i not in known and dist[i] < mini:
																__lowerCamelCase		:   Any           =       dist[i]
																__lowerCamelCase		:   List[str]           =       i
								known.add(lowercase     )
								for v in g[u]:
												if v[0] not in known and dist[u] + v[1] < dist.get(v[0]				,    10_0000     ):
																__lowerCamelCase		:   Optional[int]           =       dist[u] + v[1]
																__lowerCamelCase		:   List[str]           =       u
				for i in dist:
								if i != s:
												print(dist[i]     )





def 				a_							(    lowercase				,    lowercase=None				,    lowercase=None     )      ->Optional[Any]:






				'''simple docstring'''

				if q is None:
								__lowerCamelCase		:   int           =       [1]
				if ind is None:
								__lowerCamelCase		:   Any           =       [0] * (len(lowercase     ) + 1)  # SInce oth Index is ignored
								for u in g:
												for v in g[u]:
																ind[v] += 1
								__lowerCamelCase		:   Tuple           =       deque()
								for i in g:
												if ind[i] == 0:
																q.append(lowercase     )
				if len(lowercase     ) == 0:
								return
				__lowerCamelCase		:   Optional[Any]           =       q.popleft()
				print(lowercase     )
				for w in g[v]:
								ind[w] -= 1
								if ind[w] == 0:
												q.append(lowercase     )
				topo(lowercase				,    lowercase				,    lowercase     )





def 				a_							(    )      ->Union[str, Any]:






				'''simple docstring'''

				__lowerCamelCase		:   Tuple           =       input().strip()
				__lowerCamelCase		:   Any           =       []
				for _ in range(lowercase     ):
								a.append(map(lowercase				,    input().strip().split()     )     )
				return a, n





def 				a_							(    lowercase     )      ->List[str]:






				'''simple docstring'''

				((__lowerCamelCase)    ,       (__lowerCamelCase))		:   Optional[int]           =       a_and_n
				__lowerCamelCase		:   Optional[int]           =       list(lowercase     )
				__lowerCamelCase		:   str           =       [[0] * n for i in range(lowercase     )]
				for k in range(lowercase     ):
								for i in range(lowercase     ):
												for j in range(lowercase     ):
																if dist[i][j] > dist[i][k] + dist[k][j]:
																				__lowerCamelCase		:   str           =       dist[i][k] + dist[k][j]
																				__lowerCamelCase		:   Tuple           =       k
				print(lowercase     )





def 				a_							(    lowercase				,    lowercase     )      ->Dict:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase    ,       __lowerCamelCase		:   int           =       {s: 0}, set(), {s: 0}
				while True:
								if len(lowercase     ) == len(lowercase     ) - 1:
												break
								__lowerCamelCase		:   List[Any]           =       10_0000
								for i in dist:
												if i not in known and dist[i] < mini:
																__lowerCamelCase		:   str           =       dist[i]
																__lowerCamelCase		:   Optional[int]           =       i
								known.add(lowercase     )
								for v in g[u]:
												if v[0] not in known and v[1] < dist.get(v[0]				,    10_0000     ):
																__lowerCamelCase		:   Dict           =       v[1]
																__lowerCamelCase		:   List[str]           =       u
				return dist





def 				a_							(    )      ->Union[str, Any]:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase		:   List[Any]           =       map(lowercase				,    input().split(" "     )     )
				__lowerCamelCase		:   Optional[Any]           =       []
				for _ in range(lowercase     ):
								edges.append(map(lowercase				,    input().split(" "     )     )     )
				return edges, n





def 				a_							(    lowercase     )      ->Optional[int]:






				'''simple docstring'''

				((__lowerCamelCase)    ,       (__lowerCamelCase))		:   Any           =       e_and_n
				e.sort(reverse=lowercase				,    key=lambda lowercase     : x[2]     )
				__lowerCamelCase		:   Optional[Any]           =       [{i} for i in range(1				,    n + 1     )]
				while True:
								if len(lowercase     ) == 1:
												break
								print(lowercase     )
								__lowerCamelCase		:   List[str]           =       e.pop()
								for i in range(len(lowercase     )     ):
												if x[0] in s[i]:
																break
								for j in range(len(lowercase     )     ):
												if x[1] in s[j]:
																if i == j:
																				break
																s[j].update(s[i]     )
																s.pop(lowercase     )
																break





def 				a_							(    lowercase     )      ->int:






				'''simple docstring'''

				__lowerCamelCase		:   Tuple           =       []
				for node in graph:
								if not graph[node]:
												isolated.append(lowercase     )
				return isolated





