3096Sum Kind of Problem

3096   Sum Kind of Problem

题目描述

For this problem you will compute various running sums of values for positive integers.

输入格式:

The first line of input contains a single integer P, (1 <= P <= 10000), which is the number of data sets that follow.  Each data set should be processed identically and independently.
 
Each data set consists of a single line of input.  It contains the data set number, K, followed by an integer N, (1 <= N <= 10000).

输出格式:

For each data set there is one line of output.  The single output line consists of the data set number, K, followed by a single space followed by three space separated integers S1, S2 and S3 such that:
 
S1 = The sum of the first N positive integers. S2 = The sum of the first N odd integers. S3 = The sum of the first N even integers.

输入样例 复制
3
1 1
2 10
3 1001
输出样例 复制
1 1 1 2
2 55 100 110
3 501501 1002001 1003002

说明

3
5
通过提交
时空限制1000ms/128mb
题目来源
评测方式在线评测
题目类型
难        度