[Algorithm] 데일리 백준

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Main {
  public static void main(String[] args) throws Exception{

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    StringBuilder sb = new StringBuilder();

//    int testCount = Integer.parseInt(br.readLine());
//    for(int i = 0 ; i < testCount ; i++){
//      String[] testCase = br.readLine().split(" ");
//      int testResult = Integer.parseInt(testCase[0]) + Integer.parseInt(testCase[1]);
//      sb.append(testResult + "\n");
//    }
//    System.out.println(sb);

//    int finalNum = Integer.parseInt(br.readLine());
//    int result = 0;
//    for (int i = 1 ; i < finalNum + 1 ; i++ ){
//      result += i;
//    }
//    System.out.println(result);

//    long totalPrice = Long.parseLong(br.readLine());
//    int goods = Integer.parseInt(br.readLine());
//    Long price = 0l;
//    for(int i = 0 ; i < goods ; i++){
//      String[] buyList = br.readLine().split(" ");
//      long calculatePrice = Long.parseLong(buyList[0]) * Integer.parseInt(buyList[1]);
//      price += calculatePrice;
//    }
//
//    if(totalPrice == price){
//      System.out.println("Yes");
//    } else  {
//      System.out.println("No");
//    }

//    int byteSize = Integer.parseInt(br.readLine());
//    int longCount = byteSize / 4;
//
//    for (int i = 0 ; i < longCount ; i++){
//      sb.append("long" + " ");
//    }
//    sb.append("int");
//
//    System.out.println(sb);

    long testCount = Long.parseLong(br.readLine());
    for(int i = 0 ; i < testCount; i++){
      String[] testCase = br.readLine().split(" ");
      int result = Integer.parseInt(testCase[0]) + Integer.parseInt(testCase[1]);
//      sb.append(result + "\n");
      bw.write(result + "\n");
    }
    bw.flush();
    bw.close();
  }
}