#include <bits/stdc++.h>
using namespace std;

#pragma region Macros
#define Faster ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define m1 cout << -1 << endl
#pragma endregion

#pragma region Math
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#pragma endregion

void solve() {
    int n,k;  cin>>n>>k;
    vector<int>v(n), h(n);
    for(auto &it:v) cin>>it;
    for(int i=0;i<n;i++)    h[i]=v[i]/2;
    for(int i=1;i<n;i++)    h[i]+=h[i-1];
    int ans=0;
    for(int i=0;i<n-1;i++){
        int val=0;
        for(int j=i+1;j<n;j++){
            val= v[i]+v[j];
            cout<<i<<" "<<j<<" "<<val<<" ";
            int pre=0;
            if(i>0)
                pre=h[i-1];
            int mid=h[j-1]-h[i];
            int suf=h[n-1]-h[j];
            val+=(pre+mid+suf);
            cout<<pre<<" "<<mid<<" "<<suf<<" "<<val<<endl;
            
        }
        // cout<<val<<endl;
        if(val>k) ans++;
    }
    cout<<ans<<endl;
}

int main() {
    Faster;
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}