'''simple docstring'''





import json
import os
from functools import lru_cache
from typing import List, Optional, Tuple

import regex as re

from ...tokenization_utils import AddedToken, PreTrainedTokenizer
from ...utils import logging


__snake_case			      =    logging.get_logger(__name__)


__snake_case			      =    {'''vocab_file''': '''vocab.json''', '''merges_file''': '''merges.txt'''}

# See all MVP models at https://huggingface.co/models?filter=mvp
__snake_case			      =    {
    '''vocab_file''': {
        '''RUCAIBox/mvp''': '''https://huggingface.co/RUCAIBox/mvp/resolve/main/vocab.json''',
    },
    '''added_tokens.json''': {
        '''RUCAIBox/mvp''': '''https://huggingface.co/RUCAIBox/mvp/resolve/main/added_tokens.json''',
    },
    '''merges_file''': {
        '''RUCAIBox/mvp''': '''https://huggingface.co/RUCAIBox/mvp/resolve/main/merges.txt''',
    },
}

__snake_case			      =    {
    '''RUCAIBox/mvp''': 10_24,
}





@lru_cache()
def   lowerCAmelCase_ (				)->  Optional[int]:






      '''simple docstring'''





      UpperCAmelCase    : List[str]      =(
          list(range(ord('''!'''						)		,					ord('''~'''						) + 1						)						) + list(range(ord('''¡'''						)		,					ord('''¬'''						) + 1						)						) + list(range(ord('''®'''						)		,					ord('''ÿ'''						) + 1						)						)
      )
      UpperCAmelCase    : List[Any]      =bs[:]
      UpperCAmelCase    : Tuple      =0
      for b in range(2**8						):
            if b not in bs:
                  bs.append(__lowerCAmelCase						)
                  cs.append(2**8 + n						)
                  n += 1
      UpperCAmelCase    : Dict      =[chr(__lowerCAmelCase						) for n in cs]
      return dict(zip(__lowerCAmelCase		,					__lowerCAmelCase						)						)





def   lowerCAmelCase_ (				__lowerCAmelCase						)->  Dict:






      '''simple docstring'''





      UpperCAmelCase    : int      =set()
      UpperCAmelCase    : Optional[int]      =word[0]
      for char in word[1:]:
            pairs.add((prev_char, char)						)
            UpperCAmelCase    : int      =char
      return pairs







class 			__snake_case   (     lowercase__   ):
 __lowerCamelCase    :   str     =      VOCAB_FILES_NAMES
 __lowerCamelCase    :   str     =      PRETRAINED_VOCAB_FILES_MAP
 __lowerCamelCase    :   List[Any]     =      PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
 __lowerCamelCase    :   int     =      ["""input_ids""", """attention_mask"""]
 def __init__(  self		,   snake_case__		,   snake_case__		,   snake_case__="replace"		,   snake_case__="<s>"		,   snake_case__="</s>"		,   snake_case__="</s>"		,   snake_case__="<s>"		,   snake_case__="<unk>"		,   snake_case__="<pad>"		,   snake_case__="<mask>"		,   snake_case__=False		,   **snake_case__		,   )	->							Dict:
       '''simple docstring'''





       UpperCAmelCase    : List[Any]      =AddedToken(_A		,   lstrip=_A		,   rstrip=_A						) if isinstance(_A		,   _A						) else bos_token
       UpperCAmelCase    : Tuple      =AddedToken(_A		,   lstrip=_A		,   rstrip=_A						) if isinstance(_A		,   _A						) else eos_token
       UpperCAmelCase    : List[Any]      =AddedToken(_A		,   lstrip=_A		,   rstrip=_A						) if isinstance(_A		,   _A						) else sep_token
       UpperCAmelCase    : Optional[Any]      =AddedToken(_A		,   lstrip=_A		,   rstrip=_A						) if isinstance(_A		,   _A						) else cls_token
       UpperCAmelCase    : Optional[int]      =AddedToken(_A		,   lstrip=_A		,   rstrip=_A						) if isinstance(_A		,   _A						) else unk_token
       UpperCAmelCase    : str      =AddedToken(_A		,   lstrip=_A		,   rstrip=_A						) if isinstance(_A		,   _A						) else pad_token

       # Mask token behave like a normal word, i.e. include the space before it
       UpperCAmelCase    : List[str]      =AddedToken(_A		,   lstrip=_A		,   rstrip=_A						) if isinstance(_A		,   _A						) else mask_token

       super().__init__(
           errors=_A		,   bos_token=_A		,   eos_token=_A		,   unk_token=_A		,   sep_token=_A		,   cls_token=_A		,   pad_token=_A		,   mask_token=_A		,   add_prefix_space=_A		,   **_A		,   )
       with open(_A		,   encoding='''utf-8'''						) as vocab_handle:
             UpperCAmelCase    : int      =json.load(_A						)
       UpperCAmelCase    : str      ={v: k for k, v in self.encoder.items()}
       UpperCAmelCase    : Optional[Any]      =errors  # how to handle errors in decoding
       UpperCAmelCase    : int      =bytes_to_unicode()
       UpperCAmelCase    : Union[str, Any]      ={v: k for k, v in self.byte_encoder.items()}
       with open(_A		,   encoding='''utf-8'''						) as merges_handle:
             UpperCAmelCase    : Dict      =merges_handle.read().split('''\n'''						)[1:-1]
       UpperCAmelCase    : Any      =[tuple(merge.split()						) for merge in bpe_merges]
       UpperCAmelCase    : List[Any]      =dict(zip(_A		,   range(len(_A						)						)						)						)
       UpperCAmelCase    : Optional[int]      ={}
       UpperCAmelCase    : Optional[int]      =add_prefix_space

       # Should have added re.IGNORECASE so BPE merges can happen for capitalized versions of contractions
       UpperCAmelCase    : Dict      =re.compile(r'''\'s|\'t|\'re|\'ve|\'m|\'ll|\'d| ?\p{L}+| ?\p{N}+| ?[^\s\p{L}\p{N}]+|\s+(?!\S)|\s+'''						)
 @property
 def 	UpperCAmelCase__       (  self						)	->							Optional[int]:
       '''simple docstring'''





       return len(self.encoder						)
 def 	UpperCAmelCase__       (  self						)	->							List[Any]:
       '''simple docstring'''





       return dict(self.encoder		,   **self.added_tokens_encoder						)
 def 	UpperCAmelCase__       (  self		,   snake_case__						)	->							Tuple:
       '''simple docstring'''





       if token in self.cache:
             return self.cache[token]
       UpperCAmelCase    : Any      =tuple(_A						)
       UpperCAmelCase    : List[str]      =get_pairs(_A						)

       if not pairs:
             return token

       while True:
             UpperCAmelCase    : List[str]      =min(_A		,   key=lambda snake_case__						: self.bpe_ranks.get(_A		,   float('''inf'''						)						)						)
             if bigram not in self.bpe_ranks:
                   break
             UpperCAmelCase    : List[str]      =bigram
             UpperCAmelCase    : List[Any]      =[]
             UpperCAmelCase    : str      =0
             while i < len(_A						):
                   try:
                         UpperCAmelCase    : Optional[int]      =word.index(_A		,   _A						)
                   except ValueError:
                         new_word.extend(word[i:]						)
                         break
                   else:
                         new_word.extend(word[i:j]						)
                         UpperCAmelCase    : str      =j

                   if word[i] == first and i < len(_A						) - 1 and word[i + 1] == second:
                         new_word.append(first + second						)
                         i += 2
                   else:
                         new_word.append(word[i]						)
                         i += 1
             UpperCAmelCase    : Union[str, Any]      =tuple(_A						)
             UpperCAmelCase    : List[Any]      =new_word
             if len(_A						) == 1:
                   break
             else:
                   UpperCAmelCase    : Tuple      =get_pairs(_A						)
       UpperCAmelCase    : Union[str, Any]      =' '.join(_A						)
       UpperCAmelCase    : str      =word
       return word
 def 	UpperCAmelCase__       (  self		,   snake_case__						)	->							int:
       '''simple docstring'''





       UpperCAmelCase    : int      =[]
       for token in re.findall(self.pat		,   _A						):
             UpperCAmelCase    : Union[str, Any]      =''.join(
                 self.byte_encoder[b] for b in token.encode('''utf-8'''						)						)  # Maps all our bytes to unicode strings, avoiding control tokens of the BPE (spaces in our case)
             bpe_tokens.extend(bpe_token for bpe_token in self.bpe(_A						).split(''' '''						)						)
       return bpe_tokens
 def 	UpperCAmelCase__       (  self		,   snake_case__						)	->							Any:
       '''simple docstring'''





       return self.encoder.get(_A		,   self.encoder.get(self.unk_token						)						)
 def 	UpperCAmelCase__       (  self		,   snake_case__						)	->							str:
       '''simple docstring'''





       return self.decoder.get(_A						)
 def 	UpperCAmelCase__       (  self		,   snake_case__						)	->							Union[str, Any]:
       '''simple docstring'''





       UpperCAmelCase    : Tuple      =''.join(_A						)
       UpperCAmelCase    : Tuple      =bytearray([self.byte_decoder[c] for c in text]						).decode('''utf-8'''		,   errors=self.errors						)
       return text
 def 	UpperCAmelCase__       (  self		,   snake_case__		,   snake_case__ = None						)	->							Tuple[str]:
       '''simple docstring'''





       if not os.path.isdir(_A						):
             logger.error(f'''Vocabulary path ({save_directory}) should be a directory'''						)
             return
       UpperCAmelCase    : Optional[int]      =os.path.join(
           _A		,   (filename_prefix + '''-''' if filename_prefix else '''''') + VOCAB_FILES_NAMES['''vocab_file''']						)
       UpperCAmelCase    : Dict      =os.path.join(
           _A		,   (filename_prefix + '''-''' if filename_prefix else '''''') + VOCAB_FILES_NAMES['''merges_file''']						)

       with open(_A		,   '''w'''		,   encoding='''utf-8'''						) as f:
             f.write(json.dumps(self.encoder		,   indent=2		,   sort_keys=_A		,   ensure_ascii=_A						) + '''\n'''						)

       UpperCAmelCase    : Dict      =0
       with open(_A		,   '''w'''		,   encoding='''utf-8'''						) as writer:
             writer.write('''#version: 0.2\n'''						)
             for bpe_tokens, token_index in sorted(self.bpe_ranks.items()		,   key=lambda snake_case__						: kv[1]						):
                   if index != token_index:
                         logger.warning(
                             f'''Saving vocabulary to {merge_file}: BPE merge indices are not consecutive.'''
                             ''' Please check that the tokenizer is not corrupted!'''						)
                         UpperCAmelCase    : Any      =token_index
                   writer.write(''' '''.join(_A						) + '''\n'''						)
                   index += 1

       return vocab_file, merge_file
 def 	UpperCAmelCase__       (  self		,   snake_case__		,   snake_case__ = None						)	->							List[int]:
       '''simple docstring'''





       if token_ids_a is None:
             return [self.cls_token_id] + token_ids_a + [self.sep_token_id]
       UpperCAmelCase    : Union[str, Any]      =[self.cls_token_id]
       UpperCAmelCase    : Tuple      =[self.sep_token_id]
       return cls + token_ids_a + sep + sep + token_ids_a + sep
 def 	UpperCAmelCase__       (  self		,   snake_case__		,   snake_case__ = None		,   snake_case__ = False						)	->							List[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 None:
             return [1] + ([0] * len(_A						)) + [1]
       return [1] + ([0] * len(_A						)) + [1, 1] + ([0] * len(_A						)) + [1]
 def 	UpperCAmelCase__       (  self		,   snake_case__		,   snake_case__ = None						)	->							List[int]:
       '''simple docstring'''





       UpperCAmelCase    : Optional[Any]      =[self.sep_token_id]
       UpperCAmelCase    : int      =[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 + sep + token_ids_a + sep						) * [0]






 def 	UpperCAmelCase__       (  self		,   snake_case__		,   snake_case__=False		,   **snake_case__						)	->							List[str]:
       '''simple docstring'''





       UpperCAmelCase    : List[Any]      =kwargs.pop('''add_prefix_space'''		,   self.add_prefix_space						)
       if (is_split_into_words or add_prefix_space) and (len(_A						) > 0 and not text[0].isspace()):
             UpperCAmelCase    : Tuple      =' ' + text
       return (text, kwargs)

def   lowerCAmelCase_ (				__lowerCAmelCase		,					__lowerCAmelCase						)->  list[tuple[int, int, int]]:






      '''simple docstring'''





      UpperCAmelCase    : List[Any]      =sorted(__lowerCAmelCase		,					key=lambda __lowerCAmelCase						: edge[2]						)

      UpperCAmelCase    : Union[str, Any]      =list(range(__lowerCAmelCase						)						)

      def find_parent(__lowerCAmelCase						):
            if i != parent[i]:
                  UpperCAmelCase    : Optional[int]      =find_parent(parent[i]						)
            return parent[i]

      UpperCAmelCase    : Optional[Any]      =0
      UpperCAmelCase    : List[str]      =[]

      for edge in edges:
            UpperCAmelCase    : Dict      =find_parent(edge[0]						)
            UpperCAmelCase    : Optional[Any]      =find_parent(edge[1]						)
            if parent_a != parent_b:
                  minimum_spanning_tree_cost += edge[2]
                  minimum_spanning_tree.append(__lowerCAmelCase						)
                  UpperCAmelCase    : Optional[Any]      =parent_b

      return minimum_spanning_tree


if __name__ == "__main__":  # pragma: no cover
     __snake_case      ,  __snake_case			      =    list(map(int, input().strip().split()))
     __snake_case			      =    []

     for _ in range(num_edges):
          __snake_case      ,  __snake_case      ,  __snake_case			      =    (int(x) for x in input().strip().split())
          edges.append((nodea, nodea, cost))

     kruskal(num_nodes, edges)
