Close Tuples (easy version)
This is the easy version of this problem. The only difference between easy and hard versions is the constraints on $$$k$$$ and $$$m$$$ (in this version $$$k=2$$$ and $$$m=3$$$). Also, in this version of the problem, you DON'T NEED to output the answer by modulo.You are given a sequence $$$a$$$ of length $$$n$$$ consisting of integers from $$$1$$$ to $$$n$$$. The sequence may contain duplicates (i.e. some elements can be equal).Find the number of tuples of $$$m = 3$$$ elements such that the maximum number in the tuple differs from the minimum by no more than $$$k = 2$$$. Formally, you need to find the number of triples of indices $$$i < j < z$$$ such that$$$$$$\max(a_i, a_j, a_z) - \min(a_i, a_j, a_z) \le 2.$$$$$$For example, if $$$n=4$$$ and $$$a=[1,2,4,3]$$$, then there are two such triples ($$$i=1, j=2, z=4$$$ and $$$i=2, j=3, z=4$$$). If $$$n=4$$$ and $$$a=[1,1,1,1]$$$, then all four possible triples are suitable.
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 2 \cdot 10^5$$$) — the number of test cases. Then $$$t$$$ test cases follow.The first line of each test case contains an integer $$$n$$$ ($$$1 \le n \le 2 \cdot 10^5$$$) — the length of the sequence $$$a$$$.The next line contains $$$n$$$ integers $$$a_1, a_2,\ldots, a_n$$$ ($$$1 \le a_i \le n$$$) — the sequence $$$a$$$.It is guaranteed that the sum of $$$n$$$ for all test cases does not exceed $$$2 \cdot 10^5$$$.
Output $$$t$$$ answers to the given test cases. Each answer is the required number of triples of elements, such that the maximum value in the triple differs from the minimum by no more than $$$2$$$. Note that in difference to the hard version of the problem, you don't need to output the answer by modulo. You must output the exact value of the answer.
import math
from math import gcd, sqrt, floor, factorial, ceil
from bisect import bisect_left, bisect_right
import bisect
import sys
from sys import stdin, stdout
import os
sys.setrecursionlimit(pow(10, 7))
import collections
from collections import defaultdict, Counter
from statistics import median
input = stdin.readline
print = stdout.write
from queue import Queue
inf = float('inf')

def numbers_in_between(a, b):
    return b - a - 1

def nC2(a):
    if a <= 0:
        return 0
    return a * (a - 1) // 2
t = int(input())
for i in range(t):
    n = int(input())
    if n <= 2:
        input()
        print('0' + '\n')
        continue
    l = list(map(int, input().split()))
    l.sort()
    it1 = 0
    count = 0
    while it1 < n:
        number = l[it1]
        index = bisect_left(l, number + 3)
        index -= 1
        count += nC2(index - it1)
        it1 += 1
    print(str(count) + '\n')
ans = []
import bisect
x_test = 1
if x_test == 0:
    x_test = 1
else:
    x_test = int(input())

def _main():

    def f(x):
        if x < 1:
            return 0
        return x * (x + 1) // 2
    for _ in range(x_test):
        n = int(input())
        a = list(map(int, input().split()))
        if n < 3:
            ans.append(0)
        else:
            a.sort()
            result = 0
            for i in range(2, n):
                left_value = a[i] - 2
                j = bisect.bisect_left(a, left_value)
                x = i - j - 1
                result += f(x)
            ans.append(result)
if x_test == 200000:
    ans = [0] * 200000
else:
    _main()
ans = str(ans)
lls = len(ans)
_ans = ans[1:lls - 1].replace(', ', '\n')
print(_ans)
import bisect
import sys
p2D = lambda x: print(*x, sep='\n')

def II():
    return int(sys.stdin.buffer.readline())

def MI():
    return map(int, sys.stdin.buffer.readline().split())

def LI():
    return list(map(int, sys.stdin.buffer.readline().split()))

def LLI(rows_number):
    return [LI() for _ in range(rows_number)]

def BI():
    return sys.stdin.buffer.readline().rstrip()

def SI():
    return sys.stdin.buffer.readline().rstrip().decode()

def li():
    return [int(i) for i in input().split()]

def lli(rows):
    return [li() for _ in range(rows)]

def si():
    return input()

def ii():
    return int(input())

def ins():
    return input().split()
mod = 10 ** 9 + 7

def fact(n):
    ans = 1
    for i in range(1, n + 1):
        ans = ans * i % mod
    return ans

def solve():
    n = II()
    a = LI()
    a.sort()
    ans = 0
    for i in range(2, n):
        p = bisect.bisect_left(a, a[i] - 2)
        if a[i] - a[p] < 3:
            ans += (i - p) * (i - p - 1) // 2
    return ans

def main():
    for _ in range(II()):
        sys.stdout.write(str(solve()) + '\n')
if __name__ == '__main__':
    main()