


'''simple docstring'''

from collections import deque

def _SCREAMING_SNAKE_CASE   (A ) -> List[Any]:






       """simple docstring"""







       return input(A ).strip().split(''' ''' )

def _SCREAMING_SNAKE_CASE   (A						,				A ) -> dict[int, list[int]]:






       """simple docstring"""







       lowercase__       =				{}
       for i in range(A ):
              lowercase__       =				[]

       for e in range(A ):
              lowercase__    ,lowercase__       =				(int(A ) for i in _input(f"Edge {e + 1}: <node1> <node2> " ))
              graph[x].append(A )
       return graph

def _SCREAMING_SNAKE_CASE   (A						,				A ) -> dict[int, list[int]]:






       """simple docstring"""







       lowercase__       =				{}
       for i in range(A ):
              lowercase__       =				[]

       for e in range(A ):
              lowercase__    ,lowercase__       =				(int(A ) for i in _input(f"Edge {e + 1}: <node1> <node2> " ))
              graph[x].append(A )
              graph[y].append(A )
       return graph

def _SCREAMING_SNAKE_CASE   (A						,				A ) -> dict[int, list[tuple[int, int]]]:






       """simple docstring"""







       lowercase__       =				{}
       for i in range(A ):
              lowercase__       =				[]

       for e in range(A ):
              lowercase__    ,lowercase__    ,lowercase__       =				(int(A ) 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__":
 lowerCamelCase		,						lowerCamelCase							:     Any								=			(int(i) for i in _input('Number of nodes and edges: '))

 lowerCamelCase							:     Dict								=			int(
     _input(
         'Press 1 or 2 or 3 \n'
         '1. Unweighted directed \n'
         '2. Unweighted undirected \n'
         '3. Weighted undirected \n'
     )[0]
 )

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

def _SCREAMING_SNAKE_CASE   (A						,				A ) -> Optional[int]:






       """simple docstring"""







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

def _SCREAMING_SNAKE_CASE   (A						,				A ) -> Optional[Any]:






       """simple docstring"""







       lowercase__    ,lowercase__       =				{s}, deque([s] )
       print(A )
       while q:
              lowercase__       =				q.popleft()
              for v in g[u]:
                     if v not in vis:
                            vis.add(A )
                            q.append(A )
                            print(A )

def _SCREAMING_SNAKE_CASE   (A						,				A ) -> Optional[int]:






       """simple docstring"""







       lowercase__    ,lowercase__    ,lowercase__       =				{s: 0}, set(), {s: 0}
       while True:
              if len(A ) == len(A ) - 1:
                     break
              lowercase__       =				100_000
              for i in dist:
                     if i not in known and dist[i] < mini:
                            lowercase__       =				dist[i]
                            lowercase__       =				i
              known.add(A )
              for v in g[u]:
                     if v[0] not in known and dist[u] + v[1] < dist.get(v[0]						,				100_000 ):
                            lowercase__       =				dist[u] + v[1]
                            lowercase__       =				u
       for i in dist:
              if i != s:
                     print(dist[i] )

def _SCREAMING_SNAKE_CASE   (A						,				A=None						,				A=None ) -> List[str]:






       """simple docstring"""







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

def _SCREAMING_SNAKE_CASE   () -> Any:






       """simple docstring"""







       lowercase__       =				input().strip()
       lowercase__       =				[]
       for _ in range(A ):
              a.append(map(A						,				input().strip().split() ) )
       return a, n

def _SCREAMING_SNAKE_CASE   (A ) -> Tuple:






       """simple docstring"""







       ((lowercase__)    ,(lowercase__))       =				a_and_n
       lowercase__       =				list(A )
       lowercase__       =				[[0] * n for i in range(A )]
       for k in range(A ):
              for i in range(A ):
                     for j in range(A ):
                            if dist[i][j] > dist[i][k] + dist[k][j]:
                                   lowercase__       =				dist[i][k] + dist[k][j]
                                   lowercase__       =				k
       print(A )

def _SCREAMING_SNAKE_CASE   (A						,				A ) -> List[Any]:






       """simple docstring"""







       lowercase__    ,lowercase__    ,lowercase__       =				{s: 0}, set(), {s: 0}
       while True:
              if len(A ) == len(A ) - 1:
                     break
              lowercase__       =				100_000
              for i in dist:
                     if i not in known and dist[i] < mini:
                            lowercase__       =				dist[i]
                            lowercase__       =				i
              known.add(A )
              for v in g[u]:
                     if v[0] not in known and v[1] < dist.get(v[0]						,				100_000 ):
                            lowercase__       =				v[1]
                            lowercase__       =				u
       return dist

def _SCREAMING_SNAKE_CASE   () -> str:






       """simple docstring"""







       lowercase__    ,lowercase__       =				map(A						,				input().split(''' ''' ) )
       lowercase__       =				[]
       for _ in range(A ):
              edges.append(map(A						,				input().split(''' ''' ) ) )
       return edges, n

def _SCREAMING_SNAKE_CASE   (A ) -> str:






       """simple docstring"""







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

def _SCREAMING_SNAKE_CASE   (A ) -> Any:






       """simple docstring"""







       lowercase__       =				[]
       for node in graph:
              if not graph[node]:
                     isolated.append(A )
       return isolated








'''simple docstring'''

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

import numpy as np
import regex as re

from ...utils import is_tf_available, is_torch_available, logging


if TYPE_CHECKING:
 if is_torch_available():
  import torch
 if is_tf_available():
  import tensorflow as tf

from ...tokenization_utils import AddedToken, PreTrainedTokenizer


lowerCamelCase							:     Union[str, Any]								=			logging.get_logger(__name__)

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

lowerCamelCase							:     Tuple								=			{
    'vocab_file': {
        'Salesforce/codegen-350M-mono': 'https://huggingface.co/Salesforce/codegen-350M-mono/resolve/main/vocab.json',
    },
    'merges_file': {
        'Salesforce/codegen-350M-mono': 'https://huggingface.co/Salesforce/codegen-350M-mono/resolve/main/merges.txt',
    },
}

lowerCamelCase							:     Optional[int]								=			{
    'Salesforce/codegen-350M-mono': 2_048,
}

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






       """simple docstring"""







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

def _SCREAMING_SNAKE_CASE   (A ) -> Tuple:






       """simple docstring"""







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

class 						__lowerCAmelCase		(lowercase_  ):





      '''simple docstring'''






      lowerCAmelCase__      :  int						      =							VOCAB_FILES_NAMES
      lowerCAmelCase__      :  Union[str, Any]						      =							PRETRAINED_VOCAB_FILES_MAP
      lowerCAmelCase__      :  Optional[int]						      =							PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
      lowerCAmelCase__      :  Tuple						      =							["""input_ids""", """attention_mask"""]



      def __init__(self					:					List[Any]     ,		UpperCamelCase					:					List[str]     ,		UpperCamelCase					:					List[Any]     ,		UpperCamelCase					:					Optional[int]="replace"     ,		UpperCamelCase					:					Optional[Any]="<|endoftext|>"     ,		UpperCamelCase					:					str="<|endoftext|>"     ,		UpperCamelCase					:					Optional[int]="<|endoftext|>"     ,		UpperCamelCase					:					Optional[int]=None     ,		UpperCamelCase					:					str=False     ,		UpperCamelCase					:					Any=False     ,		**UpperCamelCase					:					Dict     ,		):

             '''simple docstring'''







             lowercase__       =				AddedToken(UpperCamelCase     ,		lstrip=UpperCamelCase     ,		rstrip=UpperCamelCase				) if isinstance(UpperCamelCase     ,		UpperCamelCase				) else bos_token
             lowercase__       =				AddedToken(UpperCamelCase     ,		lstrip=UpperCamelCase     ,		rstrip=UpperCamelCase				) if isinstance(UpperCamelCase     ,		UpperCamelCase				) else eos_token
             lowercase__       =				AddedToken(UpperCamelCase     ,		lstrip=UpperCamelCase     ,		rstrip=UpperCamelCase				) if isinstance(UpperCamelCase     ,		UpperCamelCase				) else unk_token
             lowercase__       =				AddedToken(UpperCamelCase     ,		lstrip=UpperCamelCase     ,		rstrip=UpperCamelCase				) if isinstance(UpperCamelCase     ,		UpperCamelCase				) else pad_token
             super().__init__(
                 errors=UpperCamelCase     ,		unk_token=UpperCamelCase     ,		bos_token=UpperCamelCase     ,		eos_token=UpperCamelCase     ,		pad_token=UpperCamelCase     ,		add_prefix_space=UpperCamelCase     ,		add_bos_token=UpperCamelCase     ,		**UpperCamelCase     ,		)
             lowercase__       =				add_bos_token

             with open(UpperCamelCase     ,		encoding='''utf-8'''				) as vocab_handle:
                    lowercase__       =				json.load(UpperCamelCase				)
             lowercase__       =				{v: k for k, v in self.encoder.items()}
             lowercase__       =				errors  # how to handle errors in decoding
             lowercase__       =				bytes_to_unicode()
             lowercase__       =				{v: k for k, v in self.byte_encoder.items()}
             with open(UpperCamelCase     ,		encoding='''utf-8'''				) as merges_handle:
                    lowercase__       =				merges_handle.read().split('''\n'''				)[1:-1]
             lowercase__       =				[tuple(merge.split()				) for merge in bpe_merges]
             lowercase__       =				dict(zip(UpperCamelCase     ,		range(len(UpperCamelCase				)				)				)				)
             lowercase__       =				{}
             lowercase__       =				add_prefix_space

             # Should have added re.IGNORECASE so BPE merges can happen for capitalized versions of contractions
             lowercase__       =				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					:					Any				):

             '''simple docstring'''







             return len(self.encoder				)



      def    UpperCamelCase__	(self					:					Optional[Any]				):

             '''simple docstring'''







             return dict(self.encoder     ,		**self.added_tokens_encoder				)



      def    UpperCamelCase__	(self					:					Union[str, Any]     ,		UpperCamelCase					:					Optional[int]				):

             '''simple docstring'''







             if token in self.cache:
                    return self.cache[token]
             lowercase__       =				tuple(UpperCamelCase				)
             lowercase__       =				get_pairs(UpperCamelCase				)

             if not pairs:
                    return token

             while True:
                    lowercase__       =				min(UpperCamelCase     ,		key=lambda UpperCamelCase				: self.bpe_ranks.get(UpperCamelCase     ,		float('''inf'''				)				)				)
                    if bigram not in self.bpe_ranks:
                           break
                    lowercase__    ,lowercase__       =				bigram
                    lowercase__       =				[]
                    lowercase__       =				0
                    while i < len(UpperCamelCase				):
                           try:
                                  lowercase__       =				word.index(UpperCamelCase     ,		UpperCamelCase				)
                           except ValueError:
                                  new_word.extend(word[i:]				)
                                  break
                           else:
                                  new_word.extend(word[i:j]				)
                                  lowercase__       =				j

                           if word[i] == first and i < len(UpperCamelCase				) - 1 and word[i + 1] == second:
                                  new_word.append(first + second				)
                                  i += 2
                           else:
                                  new_word.append(word[i]				)
                                  i += 1
                    lowercase__       =				tuple(UpperCamelCase				)
                    lowercase__       =				new_word
                    if len(UpperCamelCase				) == 1:
                           break
                    else:
                           lowercase__       =				get_pairs(UpperCamelCase				)
             lowercase__       =				''' '''.join(UpperCamelCase				)
             lowercase__       =				word
             return word



      def    UpperCamelCase__	(self					:					Any     ,		UpperCamelCase					:					str     ,		UpperCamelCase					:					str=None				):

             '''simple docstring'''







             if self.add_bos_token:
                    lowercase__       =				[self.bos_token_id]
             else:
                    lowercase__       =				[]

             lowercase__       =				bos_token_ids + token_ids_a

             if token_ids_a is None:
                    return output

             return output + bos_token_ids + token_ids_a



      def    UpperCamelCase__	(self					:					Optional[Any]     ,		UpperCamelCase					:					str				):

             '''simple docstring'''







             lowercase__       =				[]
             for token in re.findall(self.pat     ,		UpperCamelCase				):
                    lowercase__       =				''''''.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(UpperCamelCase				).split(''' '''				)				)
             return bpe_tokens



      def    UpperCamelCase__	(self					:					str     ,		UpperCamelCase					:					str				):

             '''simple docstring'''







             return self.encoder.get(UpperCamelCase     ,		self.encoder.get(self.unk_token				)				)



      def    UpperCamelCase__	(self					:					Any     ,		UpperCamelCase					:					Optional[int]				):

             '''simple docstring'''







             return self.decoder.get(UpperCamelCase				)



      def    UpperCamelCase__	(self					:					List[Any]     ,		UpperCamelCase					:					Optional[int]				):

             '''simple docstring'''







             lowercase__       =				''''''.join(UpperCamelCase				)
             lowercase__       =				bytearray([self.byte_decoder[c] for c in text]				).decode('''utf-8'''     ,		errors=self.errors				)
             return text



      def    UpperCamelCase__	(self					:					int     ,		UpperCamelCase					:					str     ,		UpperCamelCase					:					Optional[str] = None				):

             '''simple docstring'''







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

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

             lowercase__       =				0
             with open(UpperCamelCase     ,		'''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 UpperCamelCase				: 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!'''				)
                                  lowercase__       =				token_index
                           writer.write(''' '''.join(UpperCamelCase				) + '''\n'''				)
                           index += 1

             return vocab_file, merge_file



      def    UpperCamelCase__	(self					:					str     ,		UpperCamelCase					:					List[Any]     ,		UpperCamelCase					:					int=False     ,		**UpperCamelCase					:					Optional[int]				):

             '''simple docstring'''







             lowercase__       =				kwargs.pop('''add_prefix_space'''     ,		self.add_prefix_space				)
             if is_split_into_words or add_prefix_space:
                    lowercase__       =				''' ''' + text
             return (text, kwargs)



      def    UpperCamelCase__	(self					:					Tuple     ,		UpperCamelCase					:					Union[int, List[int], "np.ndarray", "torch.Tensor", "tf.Tensor"]     ,		UpperCamelCase					:					bool = False     ,		UpperCamelCase					:					bool = None     ,		UpperCamelCase					:					Optional[List[str]] = None     ,		**UpperCamelCase					:					Optional[Any]     ,		):

             '''simple docstring'''







             lowercase__       =				super()._decode(
                 token_ids=UpperCamelCase     ,		skip_special_tokens=UpperCamelCase     ,		clean_up_tokenization_spaces=UpperCamelCase     ,		**UpperCamelCase     ,		)

             if truncate_before_pattern is not None and len(UpperCamelCase				) > 0:
                    lowercase__       =				self.truncate(UpperCamelCase     ,		UpperCamelCase				)

             return decoded_text






      def    UpperCamelCase__	(self					:					str     ,		UpperCamelCase					:					List[str]     ,		UpperCamelCase					:					Union[str, Any]				):

             '''simple docstring'''







             def find_re(UpperCamelCase					:					Dict     ,		UpperCamelCase					:					Dict     ,		UpperCamelCase					:					Optional[Any]				):
                    lowercase__       =				pattern.search(UpperCamelCase     ,		UpperCamelCase				)
                    return m.start() if m else -1

             lowercase__       =				[re.compile(UpperCamelCase     ,		re.MULTILINE				) for pattern in truncate_before_pattern]

             lowercase__       =				list(re.finditer('''^print'''     ,		UpperCamelCase     ,		re.MULTILINE				)				)

             if len(UpperCamelCase				) > 1:
                    lowercase__       =				completion[: prints[1].start()]

             lowercase__       =				list(re.finditer('''^def'''     ,		UpperCamelCase     ,		re.MULTILINE				)				)

             if len(UpperCamelCase				) > 1:
                    lowercase__       =				completion[: defs[1].start()]

             lowercase__       =				0

             lowercase__       =				[
                 pos for pos in [find_re(UpperCamelCase     ,		UpperCamelCase     ,		UpperCamelCase				) for terminal in terminals] if pos != -1
             ]

             if len(UpperCamelCase				) > 0:
                    return completion[: min(UpperCamelCase				)]
             else:
                    return completion




