#include #define rep(i,n) for (int i = 0; i < (n); i ++) using namespace std; using ll = long long; using PL = pair; using P = pair; constexpr int INF = 1000000000; constexpr long long HINF = 1000000000000000; constexpr long long MOD = 1000000007;// = 998244353; constexpr double EPS = 1e-4; constexpr double PI = 3.14159265358979; struct Debug { template static void print_value(T value,const char* name) { cout << name << ": " << value << '\n'; } template static void print_vector(vector &vec,const char* name) { for (int i = 0;i < vec.size();++i) { cout << " " << name; printf("[%d]: ",i); cout << vec[i]; } cout << '\n'; } template static void print_2dvector(vector> &vec,const char* name) { for (int i = 0;i < vec.size();++i) { for (int j = 0;j < vec[i].size();++j) { cout << " " << name; printf("[%d][%d]: ",i,j); cout << vec[i][j]; } cout << '\n'; } } template static void print_set(set &st,const char* name) { int i = 0; for (auto itr = st.begin();itr != st.end(); ++itr,++i) { cout << " " << name; printf("[%d]: ",i); cout << *itr; } cout << '\n'; } template static void print_map(map &mp,const char* name) { for (auto p: mp) { cout << " " << name << '[' << p.first << ']' << ": " << p.second; } cout << '\n'; } }; int main() { int N,K,M; cin >> N >> K >> M; vector A(N + 1); rep(i,N) cin >> A[i + 1]; rep(i,N) A[i + 1] += A[i]; vector> dp(K + 1,vector(N + 1,0)); rep(i,N) dp[1][i + 1] = abs(A[i + 1] - A[0]); for (int i = 1;i < K;++i){ rep(j,N) { for (int k = max(j - M,0);k <= j;++k) { dp[i + 1][j + 1] = max(dp[i + 1][j + 1],dp[i][k] + abs(A[j + 1] - A[k])); } } } //Debug::print_vector(A,"A"); //Debug::print_2dvector(dp,"dp"); cout << dp.back().back() << '\n'; return 0; }