// odd-divisors
// Kanstantsin Sokal
// AC

#include <bits/stdc++.h>

using namespace std;

void solve() {
  int l, r; cin >> l >> r;

  long long answer = 0ll;
  for (int d = 1; d <= r; d += 2) {
    answer += d * 1ll * (r / d - (l - 1) / d);
  }

  cout << answer << "\n";
}

int main() {
  int cases; cin >> cases;
  for (int i = 0; i < cases; i++) {
    solve();
  }

  return 0;
}