汇编实现利用欧几里得算法，求最大公约数，同时求出最新公倍数-Assembly to achieve the Euclidean algorithm, greatest common divisor, and find the latest common multiple

输入两个正整数m和n，使用辗转相除法求它们的最大公约数和最小公倍数。-Enter two positive integers m and n, using the Euclidean algorithm find their greatest common divisor and least common multiple