# bzoj4407: 于神之怒加强版

$f(n)=\prod_{i=1}^kf(p_i^{x_i})=\prod_{i=1}^k\mu(1)*p_i^{k*x_i}+\mu(p_i)*p_i^{k*(x_i-1)}=\prod_{i=1}^kp_i^{k*(x_i-1)}*(p_i^k-1)$

/**************************************************************
Problem: 4407
User: walfy
Language: C++
Result: Accepted
Time:19252 ms
Memory:103832 kb
****************************************************************/

//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize(4)
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define fi first
#define se second
#define db double
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define ll long long
#define vi vector<int>
#define mod 1000000007
#define ld long double
#define C 0.5772156649
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define pii pair<int,int>
//#define cd complex<double>
#define ull unsigned long long
#define base 1000000000000000000
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define fin freopen("a.txt","r",stdin)
#define fout freopen("a.txt","w",stdout)
#define fio ios::sync_with_stdio(false);cin.tie(0)
template<typename T>
inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
template<typename T>
inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}

using namespace std;

const double eps=1e-8;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int N=5000000+10,maxn=400000+10,inf=0x3f3f3f3f;

int prime[N],cnt,k;
ll f[N],qk[N];
bool mark[N];
void init()
{
f[1]=1;
for(int i=2;i<N;i++)
{
if(!mark[i])prime[++cnt]=i,qk[cnt]=qp(i,k),f[i]=(qk[cnt]-1+mod)%mod;
for(int j=1;j<=cnt&&i*prime[j]<N;j++)
{
mark[i*prime[j]]=1;
if(i%prime[j]==0)
{
f[i*prime[j]]=f[i]*qk[j]%mod;
break;
}
f[i*prime[j]]=f[i]*(qk[j]-1+mod)%mod;
}
}
}
int main()
{
int T;scanf("%d%d",&T,&k);
init();
while(T--)
{
int n,m;
scanf("%d%d",&n,&m);
if(n>m)swap(n,m);
ll ans=0;
for(int i=1,j;i<=n;i=j+1)
{
j=min(n/(n/i),m/(m/i));
ll te=1ll*(f[j]-f[i-1])*(n/i)%mod*(m/i)%mod;
te=(te+mod)%mod;