import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    int K = sc.nextInt();
    long[] a = new long[N + 1];
    for (int i = 1; i <= N; i ++) {
      a[i] = sc.nextLong();
    }

    System.out.println(solve(N, K, a));
    
  }

  private static long solve(int N, int K, long[] a) {
    long[] sum = new long[N + 1];
    long[] asum = new long[N + 1];
    for (int i = 1; i <= N; i ++) {
      sum[i] = sum[i - 1] + a[i];
      if (a[i] >= 0) {
        asum[i] = asum[i - 1] + a[i];
      } else {
        asum[i] = asum[i - 1];
      }
    }
    
    long ret = Long.MIN_VALUE;;
    
    
    for (int i = 1; i <= N - K + 1; i ++) {
      long A = asum[i - 1];
      long B = sum[i + K - 1] - sum[i - 1];
      long C = asum[N] - asum[i + K - 1];
      long now = A + B + C;
      ret = Math.max(ret, now);
    }
    
    for (int i = 1; i <= N - K + 1; i ++) {
      long A = asum[i - 1];
      long C = asum[N] - asum[i + K - 1];
      long now = A + C;
      ret = Math.max(ret, now);
    }
    return ret;
  }
}


class BIT {
  private long[] array;
  private int n;

  public BIT(int n) {
    this.array = new long[n + 1];
    this.n = n;
  }

  public void add(int a, long w) {
    for (int i = a; i <= n; i += (i & -i)) {
      array[i] += w;
    }
  }

  public long sum(int a) {
    long ret = 0;
    for (int i = a; i > 0; i -= (i & -i)) {
      ret += array[i];
    }
    return ret;
  }

  public long sum(int a, int b) {
    return a == 0 ? sum(b) : (sum(b) - sum(a - 1));
  }

}


class FastScanner {
  public static String debug = null;

  private final InputStream in = System.in;
  private int ptr = 0;
  private int buflen = 0;
  private byte[] buffer = new byte[1024];
  private boolean eos = false;

  private boolean hasNextByte() {
    if (ptr < buflen) {
      return true;
    } else {
      ptr = 0;
      try {
        if (debug != null) {
          buflen = debug.length();
          buffer = debug.getBytes();
          debug = "";
          eos = true;
        } else {
          buflen = in.read(buffer);
        }
      } catch (IOException e) {
        e.printStackTrace();
      }
      if (buflen < 0) {
        eos = true;
        return false;
      } else if (buflen == 0) {
        return false;
      }
    }
    return true;
  }

  private int readByte() {
    if (hasNextByte())
      return buffer[ptr++];
    else
      return -1;
  }

  private static boolean isPrintableChar(int c) {
    return 33 <= c && c <= 126;
  }

  private void skipUnprintable() {
    while (hasNextByte() && !isPrintableChar(buffer[ptr]))
      ptr++;
  }

  public boolean isEOS() {
    return this.eos;
  }

  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();
  }

  public long[] nextLongList(int n) {
    return nextLongTable(1, n)[0];
  }

  public int[] nextIntList(int n) {
    return nextIntTable(1, n)[0];
  }

  public long[][] nextLongTable(int n, int m) {
    long[][] ret = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextLong();
      }
    }
    return ret;
  }

  public int[][] nextIntTable(int n, int m) {
    int[][] ret = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextInt();
      }
    }
    return ret;
  }
}


Measured memory_bytes: 12408