Given a sequence of integers [s₁ ... s_n] the first difference of this sequence d₁ is [s₂-s₁, s₃-s₂, s₄-s₃ ...].  Subsequent differences can be derived from the first difference, so if we number the elements in the first difference [d₁₁ d₁₂ d₁₃ d₁₄ ...] the second difference d₂ is [d₁₂-d₁₁, d₁₃-d₁₂, d₁₄-d₁₃ ...].

For some sequences, the nth difference is zero.

The triangular numbers can be thought of in this way -
s = [1 3 6 10 15 ...]
d₁ = [2 3 4 5 ...]
d₂ = [1 1 1 1 ...]
d₃ = [0 0 0 0 ...]

Given such a sequence, calculate the next three elements in the sequence.

Input

A single line of text featuring M (M<10) space separated integers

Output

A single line of text featuring 3 space separated integers

Example

Input:
15 32 57 90 131 180

Output:
237 302 375