def gcd (n1, m1):
b = n1 < m1
if b:
c = m1
m1 = n1
n1 = c
n = [1,0,0]
m = [0,1,0]
r = m[:]
while (r[0]*n1 + r[1]*m1) != 0:
q = (n[0]*n1 + n[1]*m1) // (m[0]*n1 + m[1]*m1)
r[0] = n[0] - q*m[0]
r[1] = n[1] - q*m[1]
n = m[:]
m = r[:]
n[2] = n[0]*n1 + n[1]*m1
if b:
c = n[0]
n[0] = n[1]
n[1] = c
return n
gcd (100, 35)
