#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9;
using ll = long long;
ll modpow(ll a, ll n) {
  ll res = 1;
  while (n) {
    if (n & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod;
    n >>= 1;
  }
  return res;
}
int power(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % mod)
    if (b & 1) res = 1ll * res * a % mod;
  return res;
}
std::vector<int> poswer;
void pre() {
  for (int i = 0; i < 26; ++i) {
    if (pow(2, i) <= 56454) {
      poswer.push_back(pow(2, i));
    } else {
      break;
    }
  }
}
int change(int a, int b, int c, int d, int k) {
  return abs(a - b) + abs(c - d) > k;
}
void solve() {
  int n, m;
  cin >> n >> m;
  cout << n + m << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
