

'''simple docstring'''

def       A_     (       snake_case					,				snake_case					,				snake_case       ):
  SCREAMING_SNAKE_CASE:Tuple  					=    len(snake_case       )
  SCREAMING_SNAKE_CASE:Tuple  					=    [[0] * n for i in range(snake_case       )]
  for i in range(snake_case       ):
    SCREAMING_SNAKE_CASE:List[Any]  					=    y_points[i]

  for i in range(2					,				snake_case       ):
    for j in range(snake_case					,				snake_case       ):
      SCREAMING_SNAKE_CASE:int  					=    (
          (xa - x_points[j - i + 1]) * q[j][i - 1]
          - (xa - x_points[j]) * q[j - 1][i - 1]
      ) / (x_points[j] - x_points[j - i + 1])

  return [q[n - 1][n - 1], q]


if __name__ == "__main__":
    import doctest

    doctest.testmod()











_lowercase: Dict      			=		[
    (1000, "M"),
    (900, "CM"),
    (500, "D"),
    (400, "CD"),
    (100, "C"),
    (90, "XC"),
    (50, "L"),
    (40, "XL"),
    (10, "X"),
    (9, "IX"),
    (5, "V"),
    (4, "IV"),
    (1, "I"),
]






def     a(      A       :    str       )		->       int:
					"""simple docstring"""





					a					     =   {"I": 1, "V": 5, "X": 10, "L": 50, "C": 100, "D": 500, "M": 1000}
					a					     =   0
					a					     =   0
					while place < len(A       ):
										if (place + 1 < len(A       )) and (vals[roman[place]] < vals[roman[place + 1]]):
															total += vals[roman[place + 1]] - vals[roman[place]]
															place += 2
										else:
															total += vals[roman[place]]
															place += 1
					return total






def     a(      A       :    int       )		->       str:
					"""simple docstring"""





					a					     =   []
					for arabic, roman in ROMAN:
										((a)     ,				(a))					     =   divmod(A ,     A       )
										result.append(roman * factor       )
										if number == 0:
															break
					return "".join(A       )


if __name__ == "__main__":
				import doctest

				doctest.testmod()
