#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define endl "\n"
#define double long double

const int N = 3e5 + 10;
const ll INF = 0x3f3f3f3f3f3f3f;

ll dengcha(ll kk){
  if(kk&1)return ((kk+1)/2)*kk;
  return (kk/2)*(kk+1);
}
ll n, m, k;
void solve()
{
  cin>>n>>k;
  vector<ll>b(n+5),lm(n+5),rm(n+5);
  set<ll>tp;
  for(int i=1;i<=n;i++){
    cin>>b[i];
    tp.insert(b[i]);
  }
  if(tp.size()==1){
    cout<<k<<' '<<dengcha(k)<<endl;
    return;
  }
  set<pll>st;
  stack<pll>sta;
  sta.push({0,0});
  for(int i=1;i<=n;i++){
    while(b[i]<=sta.top().first){
      sta.pop();
    }
    lm[i]=sta.top().second;
    sta.push({b[i],i});
  }
  while(!sta.empty())sta.pop();
  sta.push({0,n+1});
  for(int i=n;i>=1;i--){
    while(b[i]<=sta.top().first){
      sta.pop();
    }
    rm[i]=sta.top().second;
    sta.push({b[i],i});
  }
  for(int i=1;i<=n;i++){
    if(lm[i]>0)st.insert({b[lm[i]],b[i]});
    if(rm[i]<=n)st.insert({b[rm[i]],b[i]});
  }
  ll mi=INF,x,y;
  for(auto e:st){
    if(e.second-e.first<mi){
      mi=e.second-e.first;
      x=e.first,y=e.second;
    }
  }
  ll cnt=0,ans=0;
  set<ll>anss;
  for(ll i=1;i*i<=y-x;i++){
    if((y-x)/i-1>=1)
      anss.insert((y-x)/i-1);
    if(i-1>=1)
      anss.insert(i-1);
  }
  for(auto e:anss){
    bool ff=true;
    for(auto t:st){
      if((t.second+e)%(t.first+e)!=0){
        ff=false;break;
      }
    }
    if(ff){
      cnt++;ans+=e;
    }
  }
  cout<<cnt<<' '<<ans<<endl;
}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int _ = 1;
  cin >> _;
  while (_--)
    solve();
  return 0;
}