#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
typedef double db;
const db eps=1e-12;const int N=524300;const db pi=acos(-1);int T;
const int Mlim=524288;const db K=1/sqrt(2*pi);int x;int y;int lim;
struct cmp//虚数类 
{
    db r;db v;cmp(db a=0,db b=0){r=a;v=b;}
    friend cmp operator +(cmp a,cmp b){return cmp(a.r+b.r,a.v+b.v);}
    friend cmp operator -(cmp a,cmp b){return cmp(a.r-b.r,a.v-b.v);}
    friend cmp operator *(cmp a,cmp b){return cmp(a.r*b.r-a.v*b.v,a.r*b.v+a.v*b.r);}
    void operator /=(db a){r/=a;v/=a;}
}res[N];int r[N];int len;
inline void clear(){for(int i=0;i<lim;i++){res[i]=cmp();r[i]=0;}}
inline cmp po(cmp a,int p){cmp r(1,0);for(;p;p>>=1,a=a*a){if(p&1){r=r*a;}}return r;}
inline void clacr(){for(int i=1;i<lim;i++){r[i]=r[i>>1]>>1|(i&1)<<len;}}//计算反转数组 
inline void fft(cmp* tp,int n,int op)//fft板子 
{
    for(int i=1;i<n;i++){if(i<r[i])swap(tp[i],tp[r[i]]);}
    for(int k=1;k<n;k<<=1)
    {
        for(int s=0;s<n;s+=2*k)
        {
            cmp now(1,0);cmp rt(cos(pi/k),op*sin(pi/k));
            for(int i=s;i<s+k;i++,now=now*rt)
            {cmp ev=tp[i];cmp od=tp[i+k];tp[i]=ev+now*od;tp[i+k]=ev-now*od;}
        }
    }if(op==-1){for(int i=0;i<n;i++){tp[i]/=n;}}
}
inline db f(db x){return K*exp(x*x/-2.0);}//正态分布的概率密度函数 
inline db psp(db l,db r){db mid=(l+r)/2.0;return (r-l)*(f(l)+4.0*f(mid)+f(r))/6.0;}
inline db sp(db l,db r)//然后这是Simpson积分的板子 
{
    db mid=(l+r)/2.0;db f1=psp(l,r);db f2=psp(l,mid)+psp(mid,r);
    db res=(-eps<f1-f2&&f1-f2<eps)?f1:sp(l,mid)+sp(mid,r);return res;
}
inline void solve()
{
    scanf("%d%d",&x,&y);lim=x*y;
    if(lim<=Mlim)//判断一下fft跑的过去还是跑不过去 
    {
        for(len=0;(1<<len)<=lim;len++);lim=(1<<len);len--;
        clacr();for(int i=0;i<x;i++){res[i].r=1/(db)x;}
        fft(res,lim,1);//直接快速幂即可 
        for(int i=0;i<lim;i++){res[i]=po(res[i],y);}
        fft(res,lim,-1);
        for(int i=1;i<=10;i++)
        {
            int a;int b;scanf("%d%d",&a,&b);db ret=0;
            for(int j=a;j<=b;j++){ret+=res[j].r;}
            printf("%.6lf\n",ret);
        }
    }
    else//大数据套中心极限定理 
    {
        db mu=(db)(x-1)/2;db sigma=(db)(x*x-1)/12;
        for(int i=1;i<=10;i++)//大力转A,B范围之后计算积分即可 
        {
            db a;db b;scanf("%lf%lf",&a,&b);
            a=(a-y*mu)/sqrt(y*sigma);b=(b-y*mu)/sqrt(y*sigma);
            printf("%.6lf\n",sp(0,b)-sp(0,a));
        }lim=0;
    }
}
int main()
{scanf("%d",&T);for(int z=1;z<=T;z++){solve();clear();}return 0;//拜拜程序~}
 ```