#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 1001;
const int mod = 1e9 + 7;
mt19937_64 mt_rnd_64(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l, ll r) { return (mt_rnd_64() % (r - l + 1)) + l; }
inline void solve() {
  int n;
  cin >> n;
  while (n) {
    n--;
    int x, y;
    cin >> x >> y;
    cout << y * 2 << E;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  srand(time(0));
  solve();
  return 0;
}
