#include <cstdio>
#include <algorithm>
#include <vector>
#include <iostream>
#include <string>
#include <string.h>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>

#define X first
#define Y second
#define mp make_pair
#define pb push_back

typedef long long ll;

using namespace std;

const int MAXN = 310;
long long a[MAXN][MAXN], sum[MAXN][MAXN];
int n, m, mx;

long long getSum(int x1, int y1, int x2, int y2) {
    long long res = sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1];
    //cerr<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<"   "<<res<<endl;
    return res;
}

void read() {
    scanf("%d%d%d", &n, &m, &mx);
    //n = 1; m = 2; mx = 10;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            int x;
            scanf("%d", &x);
            a[i][j] = x;
        }
    }
    //a[1][1] = 8; a[1][2] = -7;
}

long long s[MAXN];
long long pref[MAXN], suf[MAXN];
long long npref[MAXN], nsuf[MAXN];

long long lsum[MAXN];

int kill(int st, int fin) {
    //cerr<<st<<"     "<<fin<<endl;
    if (st == fin) {
        suf[st] = s[st];
        pref[st] = s[st];
        return (s[st] > mx);
    }
    int med = (st + fin)/2;
    int ans = kill(st, med) + kill(med + 1, fin);
    int u = fin + 1;
    for (int i = st; i <= med; i++) {
        while (u > med + 1 && suf[i] + pref[u - 1] > mx) {
            u--;
        }
        ans += fin + 1 - u;
    }
    //suf
    for (int i = med + 1; i <= fin; i++) {
        nsuf[i] = suf[i];
        //cerr<<nsuf[i]<<endl;
    }
    for (int i = st; i <= med; i++) {
        nsuf[i] = suf[i] + lsum[fin] - lsum[med];
        //cerr<<suf[i] + lsum[fin] - lsum[med]<<endl;
    }
    int u0, u1;
    u0 = st, u1 = med + 1;
    for (int i = st; i <= fin; i++) {
        //cerr<<"suf"<<" "<<nsuf[u0]<<" "<<nsuf[u1]<<endl;
        if (u0 > med) {
            suf[i] = nsuf[u1];
            u1++;
            continue;
        }
        if (u1 > fin) {
            suf[i] = nsuf[u0];
            u0++;
            continue;
        }

        if (nsuf[u0] > nsuf[u1]) {
            suf[i] = nsuf[u1];
            u1++;
        }
        else {
            suf[i] = nsuf[u0];
            u0++;
        }
    }

    //pref
    for (int i = st; i <= med; i++) {
        npref[i] = pref[i];
    }
    for (int i = med + 1; i <= fin; i++) {
        npref[i] = lsum[med] - lsum[st - 1] + pref[i];
    }
    u0 = st, u1 = med + 1;
    for (int i = st; i <= fin; i++) {
        if (u0 > med) {
            pref[i] = npref[u1];
            u1++;
            continue;
        }
        if (u1 > fin) {
            pref[i] = npref[u0];
            u0++;
            continue;
        }

        if (npref[u0] > npref[u1]) {
            pref[i] = npref[u1];
            u1++;
        }
        else {
            pref[i] = npref[u0];
            u0++;
        }
    }

    /*cerr<<st<<" - "<<fin<<endl;
    for (int i = st; i <= fin; i++) {
        cerr<<pref[i]<<" ";
    } cerr<<endl;
    for (int i = st; i <= fin; i++) {
        cerr<<suf[i]<<" ";
    } cerr<<endl;*/

    return ans;
}

int process(int st, int fin) {
    for (int k = st; k <= fin; k++) {
        lsum[k] = lsum[k - 1] + s[k];
    }
    //cerr<<endl;
    //cerr<<"st fin "<<st<<" "<<fin<<endl;
    /*for (int i = st; i <= fin; i++) {
        cerr<<lsum[i]<<" ";
    } cerr<<endl;*/
    //cerr<<kill(st, fin)<<endl;
    //cerr<<"    "<<kill(st, fin)<<endl;
    return kill(st, fin);
}

void precalc() {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j];
            //cerr<<sum[i][j]<<" ";
        }
        //cerr<<endl;
    }
}

void solve() {


    long long ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            for (int k = 1; k <= m; k++) {
                s[k] = getSum(i, k, j, k);
            }
            //cerr<<"st fin "<<i<<" "<<j<<endl;
            ans += process(1, m);
            //cerr<<ans<<endl;
        }
    }


    long long res = (long long)n * (n + 1) *((ll)m)*((ll)m + 1)/4;
    //cerr<<ans<<endl;
    cout<<res - ans<<endl;
    /*cerr<<ans<<" "<<res<<" ";
    if (ans < res) {
        cerr<<"ok";
    }
    cerr<<endl;*/
}

void solve2() {
    int anss = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            for (int q = 1; q <= m; q++) {
                for (int h = q; h <= m; h++) {
                    anss += ( getSum(i, q, j, h) <= mx );
                }
            }
        }
    }
    cout<<anss<<endl;
}

int main() {
    /*int nn;
    cin>>nn>>mx;
    for (int i = 1; i <= nn; i++) {
        cin>>s[i];
    }
    cout<<process(1, nn)<<endl;*/
    int test = 1;
    cin>>test;
    while (test--) {
        read();
        precalc();
        solve();
        //solve2();
    }

    return 0;
}