#include <bits/stdc++.h>
using namespace std;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<long long> G[500005];
priority_queue<long long> pql;
priority_queue<pair<long long, long long> > pqp;
priority_queue<long long, vector<long long>, greater<long long> > pqls;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
               greater<pair<long long, long long> > >
    pqps;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
long long mod = 1000000007;
long long rui(long long number1, long long number2) {
  if (number2 == 0) {
    return 1;
  } else {
    long long number3 = rui(number1, number2 / 2);
    number3 *= number3;
    number3 %= mod;
    if (number2 % 2 == 1) {
      number3 *= number1;
      number3 %= mod;
    }
    return number3;
  }
}
long long gcd(long long number1, long long number2) {
  if (number1 > number2) {
    swap(number1, number2);
  }
  if (number1 == 0 || number1 == number2) {
    return number2;
  } else {
    return gcd(number2 % number1, number1);
  }
}
void YES(bool condition) {
  if (condition) {
    cout << "YES" << endl;
    ;
  } else {
    cout << "NO" << endl;
    ;
  }
  return;
}
void Yes(bool condition) {
  if (condition) {
    cout << "Yes" << endl;
    ;
  } else {
    cout << "No" << endl;
    ;
  }
  return;
}
void Yay(bool condition) {
  if (condition) {
    cout << "Yay!" << endl;
    ;
  } else {
    cout << ":(" << endl;
    ;
  }
  return;
}
long long n, m, num, ans, a, b, c, d, e, g, h, w, i, j, k, q;
long long x[500005], y[500005], z[500005];
long long sum[500005], lsum[500005];
char s[500005], t[500005];
void sum_init() {
  for (i = 1; i <= n; i++) {
    sum[i] = sum[i - 1] + x[i - 1];
    if (x[i - 1] >= 0) {
      lsum[i] = lsum[i - 1] + x[i - 1];
    } else {
      lsum[i] = lsum[i - 1];
    }
  }
  return;
}
long long all_sum(long long left, long long right) {
  if (right < left) {
    return 0;
  } else {
    return sum[right + 1] - sum[left];
  }
}
long long like_sum(long long left, long long right) {
  if (right < left) {
    return 0;
  } else {
    return lsum[right + 1] - lsum[left];
  }
}
void solve(long long left, long long right) {
  long long ret1 = 0, ret2 = 0;
  ret1 += like_sum(0, left - 1);
  ret1 += all_sum(left, right);
  ret1 += like_sum(right + 1, n - 1);
  ans = max(ans, ret1);
  ret2 += like_sum(0, left - 1);
  ret2 += like_sum(right + 1, n - 1);
  ans = max(ans, ret2);
  return;
}
int main() {
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> x[i];
  }
  sum_init();
  ans = 0;
  for (i = 0; i + k - 1 < n; i++) {
    solve(i, i + k - 1);
    cout << ans << endl;
    ;
  }
  return 0;
}
