矩阵切割

def solve(____):
    n, m = int(____), int(____)
    cuts = ____
    while n > ____ or m > ____:
        if n >= m:
            n //= ____
        else:
            m //= ____
        cuts += ____
    print(____)