AP2 - AP - Complete The Series (Easy)

no tags 

Arithmatic and geometric Progressions are 2 of the well known progressions in maths.

Arithmatic progression(AP) is a set in which the difference between 2 numbers in constant. for e.g., 1, 3, 5, 7, 9 .... In this series the difference between 2 numbers is 2.

The task here is very simple indeed.

You will be given the 3rd term , 3rd last term and the sum of the series. You need print length of the series & the series.

Input

First line will contain a number indicating the number of test cases.

Each of the following t lines will have 3 number '3term' ,'3Lastterm' and 'sum'

3termĀ  - is the 3rd term in of the series and

3LasttermĀ  - is the 3rd term in of the series and

sum - is the sum of the series.

Output

For each input of the test case, you need to print 2 lines.

First line should have 1 value - the number of terms in the series.

2nd line of the output should print the series numbers separated by single space.

Example

Input:
1
3 8 55

Output:
10
1 2 3 4 5 6 7 8 9 10

NOTE:

  • In all the test cases, all the series elements are positive integers.
  • The series will have at least 7 elements.
  • number of test cases <=100.
  • All the numbers will fit in 64 bits (long long in C)

hide comments
nilabja16180: 2017-02-12 20:53:57

Multiply with 2 first si that you don't get wrong ans

scorpion_ajay: 2016-12-30 20:31:51

that freaky n got me 1WA, shit, although easy one :)

kg93999: 2016-12-26 20:19:44

TLE in java
AC in c++

apurvgs: 2016-12-11 08:48:57

A problem based on high school mathematics!!
AC in one go...
make sure about long long

spartax: 2016-12-07 18:15:15

Ruby is beautiful :-)

puts n
puts (0 ... n).map {|k| d*k+a}.join(' ')

spartax: 2016-12-07 18:14:02

1 WA for not printing #terms

vishal_khanna: 2016-12-04 13:37:13

Failing in test case 7. Any idea why?

mohitgupta07: 2016-11-17 17:24:30

It till surely test your maths knowledge :) :) :)

brofreecss: 2016-11-13 06:36:04

Watch out for traps! :)

jwilyandi19: 2016-11-12 12:38:59

make sure that your algorithm has O(n) complexity for this problem


Added by:Devil D
Date:2012-03-13
Time limit:0.100s
Source limit:1500B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own