13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T73c,

We call an array of numbers $$$k$$$-exquisite if it has at least two elements and any two adjacent numbers differ by at least $$$k$$$.

You are given a permutation$$$^{\text{∗}}$$$ $$$p$$$ of length $$$n$$$. For each $$$k$$$ from $$$1$$$ to $$$n - 1$$$, find the number of $$$k$$$-exquisite subarrays$$$^{\text{†}}$$$.

$$$^{\text{∗}}$$$A permutation of length $$$n$$$ is an array that contains each integer from $$$1$$$ to $$$n$$$ exactly once, in any order.

$$$^{\text{†}}$$$A subarray of an array is a sequence of one or more consecutive elements of the array.

Input

Each test consists of several test cases. The first line contains a single integer $$$t$$$ $$$(1 \le t \le 25000)$$$ — the number of test cases. The descriptions of the test cases follow.

In the first line of each test case, an integer $$$n$$$ is given — the length of the permutation $$$(2 \le n \le 10^5)$$$.

In the second line of each test cas

Exquisite Array

Examples