Counting Subsequences

"47 is the quintessential random number," states the 47 society. And there might be a grain of truth in that.

For example, the first ten digits of Euler's constant are 2 7 1 8 2 8 1 8 2 8.

And what is their sum? It is 47.

Try walking around with your eyes open. You will soon start noticing occurrences of the number 47 everywhere.

You are given a sequence $S$ of integers that we saw somewhere in nature. Your task is to compute how strongly this sequence supports the above claims.

We call a continuous subsequence of $S$ interesting if the sum of its terms is equal to 47. For example, consider the sequence $S = (24, 17, 23, 24, 5, 47)$. It has two interesting continuous subsequences: $(23, 24)$ and $(47)$.

Given a sequence $S$, find the number of its interesting subsequences.

The first line contains an integer $T$, the number of test cases. Each test case is preceded by a blank line.

The first line of each test case contains the length of a sequence $N$. The second line contains $N$ space-separated integers $A_i$, the elements of the sequence.

For each test case, output a single line containing one integer: the count of interesting subsequences of the given sequence.

$1 \le T \le 7$