

lowercase_             = {
    'meter': 'm',
    'kilometer': 'km',
    'megametre': 'Mm',
    'gigametre': 'Gm',
    'terametre': 'Tm',
    'petametre': 'Pm',
    'exametre': 'Em',
    'zettametre': 'Zm',
    'yottametre': 'Ym',
}
# Exponent of the factor(meter)
lowercase_             = {
    'm': 0,
    'km': 3,
    'Mm': 6,
    'Gm': 9,
    'Tm': 1_2,
    'Pm': 1_5,
    'Em': 1_8,
    'Zm': 2_1,
    'Ym': 2_4,
}
def   a   (    A__			:     float   ,     A__			:     str   ,     A__			:     str  )					->   float:





      """simple docstring"""



      _lowercase			 =from_type.lower().strip('s'  )
      _lowercase			 =to_type.lower().strip('s'  )

      _lowercase			 =UNIT_SYMBOL.get(A__   ,     A__  )
      _lowercase			 =UNIT_SYMBOL.get(A__   ,     A__  )

      if from_sanitized not in METRIC_CONVERSION:
            _lowercase			 =(
                F'''Invalid \'from_type\' value: {from_type!r}.\n'''
                F'''Conversion abbreviations are: {", ".join(A__  )}'''
            )
            raise ValueError(A__  )
      if to_sanitized not in METRIC_CONVERSION:
            _lowercase			 =(
                F'''Invalid \'to_type\' value: {to_type!r}.\n'''
                F'''Conversion abbreviations are: {", ".join(A__  )}'''
            )
            raise ValueError(A__  )
      _lowercase			 =METRIC_CONVERSION[from_sanitized]
      _lowercase			 =METRIC_CONVERSION[to_sanitized]
      _lowercase			 =1

      if from_exponent > to_exponent:
            _lowercase			 =from_exponent - to_exponent
      else:
            _lowercase			 =-(to_exponent - from_exponent)

      return value * pow(10   ,     A__  )


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

  testmod()





def   a   (    A__			:     Optional[int]  )					->   Tuple:





      """simple docstring"""



      _lowercase			 =[0] * len(A__  )
      _lowercase			 =[]
      _lowercase			 =[]
      _lowercase			 =0

      for values in graph.values():
            for i in values:
                  indegree[i] += 1

      for i in range(len(A__  )  ):
            if indegree[i] == 0:
                  queue.append(A__  )

      while queue:
            _lowercase			 =queue.pop(0  )
            cnt += 1
            topo.append(A__  )
            for x in graph[vertex]:
                  indegree[x] -= 1
                  if indegree[x] == 0:
                        queue.append(A__  )

      if cnt != len(A__  ):
            print('Cycle exists'  )
      else:
            print(A__  )


# Adjacency List of Graph
lowercase_             =     {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}







topological_sort(graph)


