#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
#include <omp.h>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(1) cerr

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;
typedef long double ld;

const int D = 16;
const int RAGETREE_SZ = 1 << D;
int koosaga[2 * RAGETREE_SZ]; // actual values, internal nodes are lazy
array<int, 2> koosagamin[2 * RAGETREE_SZ];
int koosagagcd[2 * RAGETREE_SZ]; // leaves - differences, internal nodes, GCD

void apply(int idx, int val) {
  koosagamin[idx][0] += val;
  koosaga[idx] += val;
}
void build(int idx) {
  assert(idx >= RAGETREE_SZ);
  while(idx > 1) {
    idx /= 2;
    koosagamin[idx] = min(koosagamin[2*idx], koosagamin[2*idx+1]);
    koosagamin[idx][0] += koosaga[idx];
  }
}
void push(int idx) {
  assert(idx >= RAGETREE_SZ);
  for(int d = D; d > 0; d--) {
    int i = idx >> d;
    apply(2*i, koosaga[i]);
    apply(2*i+1, koosaga[i]);
    koosaga[i] = 0;
  }
}
int qry(int idx) { // query single val
  idx += RAGETREE_SZ;
  push(idx);
  return koosaga[idx];
}
array<int, 2> minqry(int lhs, int rhs) { // query range
  array<int, 2> ret = {int(2e9), int(2e9)};
  lhs += RAGETREE_SZ;
  rhs += RAGETREE_SZ;
  push(lhs);
  push(rhs);
  while(lhs <= rhs) {
    if(lhs%2) ret = min(ret, koosagamin[lhs++]);
    if(rhs%2==0) ret = min(ret, koosagamin[rhs--]);
    lhs /= 2;
    rhs /= 2;
  }
  return ret;
}
int gcdqry(int lhs, int rhs) { // query range
  int ret = 0;
  lhs += RAGETREE_SZ;
  rhs += RAGETREE_SZ;
  push(lhs);
  push(rhs);
  while(lhs <= rhs) {
    if(lhs%2) ret = gcd(ret, koosagagcd[lhs++]);
    if(rhs%2==0) ret = gcd(ret, koosagagcd[rhs--]);
    lhs /= 2;
    rhs /= 2;
  }
  return ret;
}
void upd(int lhs, int rhs, int val) { // updates a range
  lhs += RAGETREE_SZ;
  rhs += RAGETREE_SZ;
  int a = lhs;
  int b = rhs;
  while(lhs <= rhs) {
    if(lhs%2) apply(lhs++, val);
    if(rhs%2 == 0) apply(rhs--, val);
    lhs /= 2;
    rhs /= 2;
  }
  build(a);
  build(b);
}
void pointupd(int idx, int val) {
  idx += RAGETREE_SZ;
  koosaga[idx] = val;
  koosagamin[idx] = {val, idx - RAGETREE_SZ};
  while(idx > 1) {
    idx /= 2;
    koosagamin[idx] = min(koosagamin[2*idx], koosagamin[2*idx+1]);
  }
}
void diffupd(int idx, int val) { // updates a difference
  idx += RAGETREE_SZ;
  koosagagcd[idx] = abs(val);
  while(idx > 1) {
    idx /= 2;
    koosagagcd[idx] = gcd(koosagagcd[2*idx], koosagagcd[2*idx+1]);
  }
}

void rsolve() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n+1);
  int smallest = 1e9;
  int largest = 1;
  for(int i = 1; i <= n; i++) {
    cin >> v[i];
    updmin(smallest, v[i]);
    updmax(largest, v[i]);
  }
  if(smallest == largest) return void(cout << k << " " << (k*(k+ll(1))/2) << "\n");
  for(int i = 1; i <= n; i++) {
    pointupd(i, v[i]);
    diffupd(i, abs(v[i] - v[i-1]));
  }
  int g = abs(v[2] - v[1]);
  for(int i = 3; i <= n; i++) g = gcd(g, abs(v[i] - v[i-1]));
  vector<int> allf;
  for(int i = 1; i * i <= g; i++) {
    if(g%i==0) {
      allf.pb(i);
      if(i*i != g) allf.pb(g/i);
    }
  }
  sort(all(allf));
  ll reta = 0, retb = 0;
  int baseline = smallest;
  auto dfs = y_combinator([&](auto self, int lhs, int rhs) -> bool {
    if(lhs >= rhs) return true;
    int gg = gcd(qry(lhs), gcdqry(lhs+1, rhs));
    array<int, 2> cand = minqry(lhs, rhs);
    if(gg != cand[0]) return false;
    return self(lhs, cand[1]-1) && self(cand[1]+1, rhs);
  });
  int orig = smallest;
  for(int out: allf) {
    if(out - baseline > k) break;
    if(out > orig) {
      upd(1, n, out - orig);
      orig = out;
      if(dfs(1, n)) {
        reta++;
        retb += out - baseline;
      }
    }
  }
  cout << reta << " " << retb << "\n";
}

void solve() {
  int t;
  cin >> t;
  while(t--) rsolve();
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}