A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?
The input contains two integers *a* and *b* (0 ≤ *a*, *b* ≤ 10<sup class="upper-index">3</sup>), separated by a single space.
import sys
import os
import heapq
from heapq import heapify
from math import ceil, floor



# Priority Queue



# bundle ===================================

def debug(*args):
    return
    print(*args)


def is_even(num):
    return num % 2 == 0


def is_odd(num):
    return num % 2 != 0


def assert_result(input_case, output_case, actual_result):
    if actual_result != output_case:
        print("error")
        print("input:", input_case, "actual:", actual_result, "expected:", output_case)
        exit(1)
        return


def expect(*input_case, output_case, ):
    actual_result = solve_case(*input_case)
    assert_result(input_case, output_case, actual_result)


def get_at_or_null(elements, index):
    if index < 0 or index >= len(elements):
        return None
    return elements[index]


def read_lines():
    filename = "./input.txt"

    if os.path.exists(filename):
        # read from file
        with open(filename, 'r') as f:
            lines = f.readlines()
    else:
        # read from stdin
        lines = sys.stdin.readlines()
    return [line.rstrip('\n') for line in lines]


# end bundle ===================================


def solve_case(K):
    costAll = 0
    return costAll


_i = 0
lines = []
def next():
    global _i
    line = lines[_i]
    _i += 1
    return line

def toBinary(a):
  l,m=[],[]
  for i in a:
    l.append(ord(i))
  for i in l:
    m.append(int(bin(i)[2:]))
  return m
def solve():
    lines = read_lines()

    for l in lines:
        a, b = map(int, l.split(" "))
        print(a + b)



if __name__ == '__main__':
    # test()
    solve()

 	 	 		    	  		 		 	   	 					