#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<ll,ll> P;
#define mod 1000000007

ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;} 
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}

int main(){
    ll n;
    cin >> n;
    vector<ll> ans;
    ans.push_back(6);
    ans.push_back(10);
    ans.push_back(15);
    ll kazu=n;
    n=n-3;
    for(ll i=1;i<=10000;i++){
        if(i==6||i==10||i==15) continue;
        if(n==0) break;
        if(i%6==0){
            ans.push_back(i);
            n--;
            continue;
        }
        if(i%10==0){
            ans.push_back(i);
            n--;
            continue;
        }
        if(i%15==0){
            ans.push_back(i);
            n--;
            continue;
        }
    }
    
    //cout << n << endl;
    
    for(ll i=0;i<kazu;i++){
        cout << ans[i] << " ";
    }
    
    cout << endl;
    

    return 0;
}










#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define rep(n) for(ll i=0;i<n;++i)
 
int main(){
    int t;
    cin >> t;
    rep(t){
        ll l,r;
        cin >> l >> r;
        if (2*l > r) cout << 0 << endl;
        else cout << (r - 2*l + 2)*(r - 2*l + 1) / 2 << endl;
    }
}