#include<cstdio>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>#include<set>#include<map>#include<stack>#include<vector>#include<queue>#include<string>#include<sstream>#define eps 1e-9#define ALL(x) x.begin(),x.end()#define INS(x) inserter(x,x.begin())#define rep(i,j,k) for(int i=j;i<=k;i++)#define MAXN 20005#define MAXM 40005#define INF 0x3fffffff#define PB push_back#define MP make_pair#define X first#define Y second#define clr(x,y) memset(x,y,sizeof(x));using namespace std;typedef long long LL;int i,j,k,n,m,x,y,T,ans,big,cas,num,len;bool flag;const double pi=acos(-1.0);double l,r;double f(double u){ return cos(u)+2.0;}double df(double u){ return (2.0+cos(u))*sqrt(1.0+sin(u)*sin(u));}double xps(double l,double r){ return (r-l)*(df(r)+4.0*df((l+r)/2)+df(l))/6.0;}double f2(double u){ return 4.0*sin(u)+sin(u*2.0)/4.0+9.0*u/2.0;}int main(){ scanf("%d",&T); while (T--) { scanf("%lf%lf",&l,&r); double ans=0; double g=l; double h=(r-l)/5001; for (i=1;i<=5001;i++) { ans+=xps(g,g+h); g+=h; } printf("%.2lf ",pi*(f2(r)-f2(l))); printf("%.2lfn",2.0*pi*ans+pi*f(l)*f(l)); }}
