Untitled

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int MOD = 1e9 + 7;

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << " "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
// Base case for printing basic data types
template <class T> void _print(T t) { cerr << t; }

// Specializations for common STL containers
template <class T> void _print(vector<T> v) { cerr << "[ "; for (T i : v) { _print(i); cerr << " "; } cerr << "]"; }
template <class T> void _print(set<T> v) { cerr << "[ "; for (T i : v) { _print(i); cerr << " "; } cerr << "]"; }
template <class T> void _print(multiset<T> v) { cerr << "[ "; for (T i : v) { _print(i); cerr << " "; } cerr << "]"; }
template <class T> void _print(stack<T> v) { vector<T> t; while (!v.empty()) t.push_back(v.top()), v.pop(); reverse(t.begin(), t.end()); _print(t); }
template <class T> void _print(queue<T> v) { vector<T> t; while (!v.empty()) t.push_back(v.front()), v.pop(); _print(t); }

template <class T, class V> void _print(pair<T, V> p) { cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}"; }
template <class T, class V> void _print(map<T, V> v) { cerr << "[ "; for (auto i : v) { _print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void _print(unordered_map<T, V> v) { cerr << "[ "; for (auto i : v) { _print(i); cerr << " "; } cerr << "]"; }


int main() {
    
    int t;
    cin >> t;
    while (t--) {
        int n; cin>>n;
        for(int i = n+1;i<=2*n;i++){
            cout <<i<<" ";
        }
        cout <<endl;

    }
    return 0;
}