#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
const int all = 100005;
int m[ all ];
int bin_find( int, int, int, bool );
int main(void)
{
    int t, n, st, en, d, tmp;
    //freopen( "E://test.txt", "rw+", stdin );
    scanf( "%d", &t );
    while( t -- )
    {
        scanf( "%d", &n );
        for( int i=1; i <= n; ++ i ){
            scanf( "%d", m+i );
        }

        sort( m+1, m+n+1 );
        scanf( "%d", &d );
        while( d -- ){
            scanf( "%d%d", &st, &en );
            tmp = st;
            if( ( en < m[1] || st > m[n] ) ){
                st = 0;
                en = 1;
            }
            else{
                st = tmp <= m[1] ? 0 : bin_find( 1, n, tmp, true );
                en = en >= m[n] ? n+1 : bin_find( 1, n, en, false );
            }
            printf( "%d\n", en-st-1 );
        }
    }
    return 0;
}

int bin_find( int l, int r, int num, bool isleft )
{
    if( r-l <= 1 ){
        if( isleft ){
            return l;
        }
        else{
            return r;
        }
    }

    if( isleft ){
        if( num == m[l] ){
            return l;
        }
    }
    else if( num == m[r] ){
        return r;
    }

    int mid = (l+r)/2;
    if( m[mid] == num ){
        if( isleft ){
            return bin_find( l, mid, num, isleft );
        }
        else{
            return bin_find( mid, r, num, isleft );
        }
    }

    else if( m[mid] < num ){
        return bin_find( mid, r, num, isleft );
    }

    else{
        return bin_find( l, mid, num, isleft );
    }
}