HDU 6027 Easy Summation

// 1.别用pow，有精度问题
// 2.自己写的pow函数内也要除以BIG

#include <iostream>
using namespace std;

long long BIG = 1000000000 + 7;


long long Pow(int n, int k){
    long long cnt = 1;
    for(int i = 0; i < k; i++){
        cnt *= n;
        cnt %= BIG;
    }

    return cnt;
}

int main(){
    int times;
    cin >> times;
    int k;
    float n;
    long long sum;
    while(times--){
        sum = 0;
        cin >> n >> k;

        for(float i = 1; i <= n; i++){
            sum += Pow(i, k);
            sum %= BIG;
        }
        cout << sum << endl;
    }


    return 0;
}