PROGRAMMING:greatest common factor
The greatest common divisor of two positive integers m and N is obtained by division and recursion.
###Input format:
Enter two positive integers m, n.
###Output format:
Output the division process and the final result according to the requirements, and separate the space between the output results.
###Input example:
```in
21 35
```
###Output example:
```out
gcd(21,35) gcd(35,21) gcd(21,14) gcd(14,7) 7
```
answer：If there is no answer, please comment
###Input format:
Enter two positive integers m, n.
###Output format:
Output the division process and the final result according to the requirements, and separate the space between the output results.
###Input example:
```in
21 35
```
###Output example:
```out
gcd(21,35) gcd(35,21) gcd(21,14) gcd(14,7) 7
```
answer：If there is no answer, please comment