#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3
const int N=150005;
const int mod=1e9+7;

int main() {
    int n,t,k;
    cin>>t;
    while (t--) {
        cin>>n>>k;
        long long sum=k;
        sum*=k+1;
        if (sum>2*n) {
            cout<<"-1"<<endl;
            continue;
        } else if (sum==2*n) {
            sum=1;
            for (int i=2; i<=k; i++) {
                sum*=i;
                sum%=mod;
            }
            cout<<sum<<endl;
            continue;
        }
        sum=1;
        int mid=n/k,left=n-k*mid,flag;
        if (k%2==1) {
            for (int i=1; i<=k; i++) {
                flag=mid+k/2-i+1;
                if (left) {
                    flag++;
                    left--;
                }
//                cout<<flag<<" ";
                sum*=flag;
                sum%=mod;
            }
        } else {
            for (int i=k/2+2; i<=k+1; i++) {
                flag=mid+k/2-i+1;
                if (left) {
                    flag++;
                    left--;
                }
//                cout<<flag<<" ";
                sum*=flag;
                sum%=mod;
            }
            for (int i=1; i<=k/2; i++) {
                flag=mid+k/2-i+1;
                if (left) {
                    flag++;
                    left--;
                }
//                cout<<flag<<" ";
                sum*=flag;
                sum%=mod;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}