Given a sequence of K integers { N_{1}, N_{2}, …, N_{K} }. A continuous subsequence is defined to be { N_{i}, N_{i+1}, …, N_{j} } where 1 <= i <= j <= K. The *Maximum Subsequence* is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.