#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
// #define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
// 1->close(c), 0->open(o)
#define r11(i, l, r) for (int i = (l); i <= (r); ++i)
#define p11(i, l, r) for (int i = (r); i >= (l); --i)
#define r10(i, l, r) for (int i = (l); i < (r); ++i)
#define p10(i, l, r) for (int i = (r)-1; i >= (l); --i)
// #define r01(i, l, r) for (int i = (l) + 1; i <= (r); ++i)
// #define p01(i, l, r) for (int i = (r); i > (l); --i)
#define r1n(i, n) r11(i, 1, n)
#define r0n(i, n) r10(i, 0, n)
#define p1n(i, n) p11(i, 1, n)
#define p0n(i, n) p10(i, 0, n)
#define FOR(i, s, e, step) for (int i = s; i <= e; i += step)
#define fora(i, v) for (auto i : (v))
#define fori(i, v) for (auto i = (v).begin(); i != (v).end(); ++i)
#define all(v) (v).begin(), (v).end()
#define all_(v, n) (v) + 1, (v) + (n) + 1
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
const ll mod = 998244353;
template <typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template <typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
// #define MULTIPLE_TEST_CASES 1
inline void _sol() {
    int n, m;
    cin >> n >> m;
    vi a(n);
    vi f(n);
    ll sum = 0;
    int l = 0;
    r0n(i, n) {
        cin >> a[i];
        sum += a[i];
        while (sum > m && l < i) {
            sum -= a[l++];
        }
        if (sum == m) f[i] = 1 + (l == 0 ? 0 : f[l - 1]);
    }
    cout << *max_element(f.begin(), f.end()) << endl;
}
// signed main() {
int main() {
    // freopen(".in", "r",stdin);
    // freopen(".out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
#ifdef MULTIPLE_TEST_CASES
    int t;
    cin >> t;
    while (t--) {
        _sol();
    }
#else
    _sol();
#endif
    return 0;
}