Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. George and Job

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn't have enough money, so George was going to work as a programmer. Now he faced the following problem at the work.

Given a sequence of *n* integers *p*_{1}, *p*_{2}, ..., *p*_{n}. You are to choose *k* pairs of integers:

in such a way that the value of sum is maximal possible. Help George to cope with the task.

Input

The first line contains three integers *n*, *m* and *k* (1 ≤ (*m* × *k*) ≤ *n* ≤ 5000). The second line contains *n* integers *p*_{1}, *p*_{2}, ..., *p*_{n} (0 ≤ *p*_{i} ≤ 10^{9}).

Output

Print an integer in a single line — the maximum possible value of sum.

Examples

Input

5 2 1

1 2 3 4 5

Output

9

Input

7 1 3

2 10 7 18 5 33 0

Output

61

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2022 23:24:28 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|