def gcd(m,n):
    if m < n:
        n,m = m,n
    if n == 0:
        return m
    return gcd(n,m%n)