def snt(n):
kt=True
for i in range(2,int(n(0.5))+1):
if n%i==0:
kt=False
return kt
a=[]
n=105
for i in range(2,n+1):
if snt(i)==True:
a.append(i)
t=int(input())
for i in range(t):
n=int(input())
print(a[n])

saidojasoidjasiodjasoidjassaiojdaosi

include <bits/stdc++.h>

using namespace std;
int n, m, a[1000005], res, d[1000005];
int main() {
cin >> n >> m;
for ( int i = 1; i <= n; i++ ) {
cin >> a[i];
d[a[i]]++;
}
sort ( a + 1, a + 1 + n );
for ( int i = n; i >1; i-- ) {
res=res+ upper_bound ( a + 1, a + i, m - a[i] )-a-1;
}
cout<<res;
}

L