12501250 SUSTech Online Judge
Problem 1250 --[Easy I] Crazy Plan

1250: [Easy I] Crazy Plan

Time Limit: 2 Sec  Memory Limit: 2 MB
Submit: 1125  Solved: 262
[Submit][Status][Web Board]

Description

Neko is crazy at solving the algorithm problems recently. He sets a plan for himself:

The \(1^{st}\) day, he will get on 1 problem solved.

The \(2^{nd}\) day, he will get on 3 problems solved.

The \(3^{rd}\) day, he will get on 6 problems solved.

...

The \(n^{th}\) day, he will get on \(n(n+1)/2\) problems solved.

Neko wants to know how many problems he will solve after \(K\) days.

Input

The first line contains a single integer \(T(1{\leq}T{\leq}1.1*10^6)\) —— the number of test case.

The \(2^{nd}\) line to the \((T+1)^{th}\) line, each line contains a single integer \(K(1{\leq}K{\leq}10^6)\) —— the number of days.

Output

Print the number of problems Neko solved. Each test case for one line.

Sample Input

3
1
2
3

Sample Output

1
4
10

HINT

Source

[Submit][Status]