Sanggeun's Friends

Time limit1sMemory limit128 MB

Summary

For each test case, read the counts of male and female friends and print their sum; stop at the two zeros line.

Level: Easy1 of 10
Topics: Math, Implementation
Solved: No attempts yet

Problem

Sanggeun has $M$ male friends and $F$ female friends. Given these two numbers, write a program that finds the total number of friends.

Input

The input consists of several test cases. Each test case is a line with two integers $M$ and $F$ , the number of Sanggeun's male friends and female friends respectively ( $1 \le M, F \le 5$ ).

The last line of the input contains two zeros.

Output

For each test case, print the total number of Sanggeun's friends on its own line.

Examples1

Example 1
Input
```
2 2
2 3
5 5
1 1
0 0
```
Expected output
```
4
5
10
2
```