gcd function in python

>>> import math
>>> math.gcd(9, 12)
3

Here is what the above code is Doing:
1. We are importing the math module.
2. We are using the gcd function from the math module to find the greatest common divisor of 9 and 12.
3. The greatest common divisor of 9 and 12 is 3.

Task
You are given two integers, n and m. Find their greatest common divisor, and print it to the console (with print()).

Input Format
Two lines of input:
n: Integer
m: Integer

Constraints
1<=n<=2*10**9 1<=m<=2*10**9 Output Format Print the greatest common divisor of the two numbers. Sample Input 72 120 Sample Output 24 Explanation The greatest common divisor of 72 and 120 is 24.