import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.NoSuchElementException;

class SlidingQueue {
	
	class Pair {
		long v,cnt;
		
		public Pair(long v,long cnt) {
			this.v=v;
			this.cnt=cnt;
		}
	}
	
	int sz=0;
	Deque<Pair> st=new ArrayDeque<>();
	final long INF=Long.MAX_VALUE/3;
	
	
	void push(long v) {
		int cnt=1;
		while (!st.isEmpty() && st.peekLast().v <= v) {
			cnt+=st.peekLast().cnt;
			st.pollLast();
		}
		st.addLast(new Pair(v,cnt));
		++sz;
	}
	
	void pop() {
		st.peekFirst().cnt--;
		if (st.peekFirst().cnt==0) st.pollFirst();
		--sz;
	}
	
	long max() {
		if (st.isEmpty()) {
			return -INF;
		} else {
			return st.peekFirst().v;
		}
	}
}

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int K=sc.nextInt();
		int M=sc.nextInt();
		long[] A=new long[N];
		long[] s=new long[N+1];
		for (int i=0;i<N;++i) {
			A[i]=sc.nextLong();
		}
		for (int i=1;i<=N;++i) {
			s[i]=A[i-1]+s[i-1];
		}
		
		long[][] dp=new long[3001][3001];
		Arrays.fill(dp[0], -Long.MAX_VALUE/3);
		dp[0][0]=0;
		for (int t=0;t<K;++t) {
			SlidingQueue sa=new SlidingQueue();
			SlidingQueue sb=new SlidingQueue();
			for (int i=0;i<N;++i) {
				sa.push(dp[t][i]-s[i]);
				sb.push(dp[t][i]+s[i]);
				if (sa.sz>M) sa.pop();
				if (sb.sz>M) sb.pop();
				dp[t+1][i+1]=Math.max(sa.max()+s[i+1],sb.max()-s[i+1]);
			}
		}
		System.out.println(dp[K][N]);
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
	
	
	class FastScanner {
	    private final InputStream in = System.in;
	    private final byte[] buffer = new byte[1024];
	    private int ptr = 0;
	    private int buflen = 0;
	    private boolean hasNextByte() {
	        if (ptr < buflen) {
	            return true;
	        }else{
	            ptr = 0;
	            try {
	                buflen = in.read(buffer);
	            } catch (IOException e) {
	                e.printStackTrace();
	            }
	            if (buflen <= 0) {
	                return false;
	            }
	        }
	        return true;
	    }
	    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
	    public String next() {
	        if (!hasNext()) throw new NoSuchElementException();
	        StringBuilder sb = new StringBuilder();
	        int b = readByte();
	        while(isPrintableChar(b)) {
	            sb.appendCodePoint(b);
	            b = readByte();
	        }
	        return sb.toString();
	    }
	    public long nextLong() {
	        if (!hasNext()) throw new NoSuchElementException();
	        long n = 0;
	        boolean minus = false;
	        int b = readByte();
	        if (b == '-') {
	            minus = true;
	            b = readByte();
	        }
	        if (b < '0' || '9' < b) {
	            throw new NumberFormatException();
	        }
	        while(true){
	            if ('0' <= b && b <= '9') {
	                n *= 10;
	                n += b - '0';
	            }else if(b == -1 || !isPrintableChar(b)){
	                return minus ? -n : n;
	            }else{
	                throw new NumberFormatException();
	            }
	            b = readByte();
	        }
	    }
	    public int nextInt() {
	    	return (int)nextLong();
	    }
	}
}