Find GCD of two numbers in python

gcd.py

#!/usr/bin/env python3


def gcd():
    m = int(input("Please enter first number:\n"))
    n = int(input("Please enter second number:\n"))
    if m > n:
        num_list = range(m)
    else:
        num_list = range(n)

    divisors_list = []
    i = 1
    while i < len(num_list):
        if (m % num_list[i] == 0) and (n % num_list[i] == 0):
            divisors_list.append(num_list[i])
        i += 1

    print("GCD is ", divisors_list[-1])


if __name__ == '__main__':
    gcd()