#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
ull a[5005], n, m, k, dp[5005][5005];
ull call(ull i, ull cnt){
if(dp[i][cnt]!=-1)
return dp[i][cnt];
if(i>(n-m) || cnt>=k)
return 0;
ull opt1=0, opt2=0;
for(ull v=i; v<i+m; v++){
opt1+=a[v];
}
opt1= opt1+call(i+m, cnt+1);
opt2= call(i+1, cnt);
return dp[i][cnt]= max(opt1,opt2);
}
main(){
cin>> n>> m>> k;
memset(dp, -1, sizeof dp);
for(ull i=0;i<n;i++)
cin>>a[i];
cout<< call(0,0) <<endl;
}
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |