#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<deque>
#include<cctype>
#include<string.h>
#include<math.h>
#include<time.h>
#include<random>
#include<stack>
#include<string>
//#include<bits/stdc++.h>
#include <unordered_map>
#define ll                                   long long
#define lowbit(x) (x & -x)
#define endl "\n"//                           交互题记得删除
using namespace std;
mt19937 rnd(time(0));
const ll mod = 998244353;
//const ll p=rnd()%mod;
ll ksm(ll x, ll y)
{
	ll ans = 1;
	while (y)
	{
		if (y & 1)
		{
			ans = ans % mod * (x % mod) % mod;
		}
		x = x % mod * (x % mod) % mod;
		y >>= 1;
	}
	return ans % mod % mod;
}
ll gcd(ll x, ll y)
{
	if (y == 0)
		return x;
	else
		return gcd(y, x % y);
}
void fio()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}
ll a[650000];
ll b[650000];
set<pair<ll,ll>>p;
set<ll>q;
vector<ll>op;
int main()
{
	fio();
	ll t;
	cin>>t;
	while(t--)
	{
		op.clear();
		q.clear();
		p.clear();
		   ll n,f;
	       cin>>n>>f;
		   ll gs=0;
		   for(ll i=1;i<=n;i++)
		   {
			cin>>a[i];
			if(a[i]==a[1])
			gs++;
	       }
			if(gs==n)
			{
				cout<<f<<" "<<(1+f)*f/2<<endl;
				continue;
			}
			set<ll>q;
			ll ko=0;
			ll zk,zr;
			for(ll i=1;i<n;i++)
			{
				ll l=a[i],r=a[i+1];
				if(l>r)
				swap(l,r);
				if(l==r)continue;
				p.insert({l,r});
				if(i+2<=n&&a[i]!=a[i+2])
				{
					ll u=a[i],j=a[i+2];
					if(u>j)swap(u,j);
				p.insert({u,j});
				}
			}
			for(auto j:p)
			{
				ll l=j.first,r=j.second;
				//cout<<l<<" "<<r<<endl;
				op.clear();
				if(ko==0)
				{
					r-=l;
					for(ll u=1;u*u<=r;u++)
					{
						if(r%u==0)
						{
							if(u-l>=1&&u-l<=f)
							{
								q.insert(u-l);
							}
							if(r/u-l>=1&&r/u-l<=f) 
							{
								q.insert(r/u-l);
							}
						}
					}
					ko=1;
				}
				else 
				{
					for(auto k:q)
					{
						if((r+k)%(l+k)==0)
						{
							continue;
						}
						else 
						{
							op.push_back(k);
						}
					}
					for(auto k:op)
					q.erase(k);
					if(q.size()==0)
					break;
				}
			} 
			ll ans=0;
			for(auto j:q)
			{
				ans+=j;
			}
			cout<<q.size()<<" "<<ans<<endl;
	}
}