import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class SumOfAbsoluteDifferences {

    static int solve(int a[], int n, int k)
    {
        int[][] mat = new int[a.length][k];
        int rez = 0;

        for (int i = 1; i < n; i++)
        {
            for (int j = 1; j < k; j++)
            {
                for (int k1 = 0; k1 < i; k1++)
                {
                    int raz = Math.abs(a[i] - a[k1]);
                    if (mat[i][j] < mat[k1][j-1] + raz)
                        mat[i][j] = mat[k1][j-1] + raz;
                    //System.out.printf("%d - %d = %d\n", a[i], a[k1], raz);
                }
                //System.out.println("--------------------------------");
                if (mat[i][j] > rez) rez = mat[i][j];
            }
        }
        /*
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < k; j++)
                System.out.print(mat[i][j] + " ");
            System.out.println("");
        }*/
        return rez;
    }

    public static void main(String[] args) throws Exception {
        int i, j, k;

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int N = Integer.parseInt(st.nextToken());
        int K = Integer.parseInt(st.nextToken());

        int numbers[] = new int[N];

        st = new StringTokenizer(br.readLine());
        for (i = 0; i < N; i++) {
            numbers[i] = Integer.parseInt(st.nextToken());
        }

        int res = solve(numbers, N, K);
        System.out.println(res);

        br.close();

    }

}