#include <bits/stdc++.h>
using namespace std;
long long po(long long a, long long b) {
  if (b == 0) return 1;
  long long ans = 1;
  if (b % 2 == 0) {
    ans = po(a, b / 2) % 1000000007;
    ans = (ans % 1000000007 * ans % 1000000007) % 1000000007;
  } else {
    ans = po(a, (b - 1) / 2) % 1000000007;
    ans = (ans % 1000000007 * ans % 1000000007 * a) % 1000000007;
  }
  return ans % 1000000007;
}
vector<string> tokens;
void separate_string(string line) {
  stringstream check1(line);
  string lav;
  while (getline(check1, lav, '*')) {
    tokens.push_back(lav);
  }
}
set<long long> divisors;
set<long long> prims;
void get_Divisors(long long n) {
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i) {
        divisors.insert(n / i);
      } else {
        divisors.insert(i);
        divisors.insert(n / i);
      }
    }
  }
}
void get_Prims(long long n) {
  int i;
  while (n % 2 == 0) {
    prims.insert(2);
    n = n / 2;
  }
  for (i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      prims.insert(i);
      n = n / i;
    }
  }
  if (n > 2) prims.insert(n);
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
void solve() {
  long long a, b;
  cin >> a >> b;
  cout << a + b;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
    cout << "\n";
  }
}
