PROGRAMMING:Finding the greatest common divisor with functions of D series

There are two numbers n, M; We want to find the greatest common divisor of N and m.
###Input format:
There are several groups of test data, which are processed to the end of the file. Each group of test data input integer n, m (0 < n, m < 1000000).
###Output format:
Output the greatest common divisor of N and m, each group of data occupies one row.
###Input example:
Here is a set of inputs. For example:
```in
2 3
4 20
```
###Output example:
The corresponding output is given here. For example:
```out
one
four
```







answer：If there is no answer, please comment