#include <iostream>
#include <ranges>
#include <vector>
#define sv std::ranges::views::

using namespace std;
using tp = long long int;

signed main() {
  tp n, m, tar = -1ull / 4;
  scanf("%lld%lld", &n, &m);
  vector<tp> v(n + 1, 0);
  vector f(m + 1, vector<tp>(m + 1, -1ull / 4));
  for (auto&& i : v | sv drop(1)) {
    scanf("%lld", &i);
  }
  f[0][m] = 0;
  for (tp i = 1; i <= n; ++i) {
    v[i] += v[i - 1];
    vector tf = vector(m + 1, vector<tp>(m + 1, -1ull / 4));
    for (tp j = 0; j <= m; ++j) {
      tp MIN = -1ull / 4;
      for (tp k = m; ~k; --k) {
        MIN = min(MIN, f[j][k]);
        if (j + k <= m) {
          tf[j + k][k] = min(tf[j + k][k], MIN + abs(j + k - v[i]));
        }
      }
    }
    f = tf;
  }
  for (tp i = 0; i <= m; ++i) {
    tar = min(tar, f[m][i]);
  }
  cout << tar;
  return 0;
}

/*
 */

/*#################################################################
#.................................................................#
#.............#......#.......This.Code.Was.Created.By.RBTree......#
#............#.#....#.#..............Limiting-Factor..............#
#.............########............................................#
#............#........#..##############################...........#
#...........#..V....V......#..#........................#..#...#...#
#............#........#....#..........###..###..........#..#.#.#..#
#............#..X##X..#..#............#....#.#...........#..#...#.#
#...........#...N##N...#..#...........###..###..........#.........#
#.......MOE..#..@.....#....#.#.#.#...................#.#..........#
#.............########.....#.#.#.##############.#.#..#.#..........#
#..........................#.#.#.#.............#.#.#.#.#..........#
#......#########...........#.#.#.#.................#.#.#..........#
#.....#.........#..........#.#.#.#.................#.#.#..........#
#.#.#.#G#R#A#S#S#.#.#......#.#.#.#.................#.#.#..........#
#.###################......#.#.#.#.................#.#.#..........#
#...........................#.#.#...................#.#...........#
#.................................................................#
#################################################################*/