#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int n, m,u,min1,max1;
	int a[10000];
	int b=0,x;
	int c[10000];
	scanf("%d%d",&n,&m);
	min1=min(n,m);
	max1 = max(n,m);
	x = max1 + 1 - min1;
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	while (x--)
	{
		for (int p=1;p<=x;p++)//控制首元素
		{
			u = p;
			for (int k = 1; k <= min1;k++)//控制相加
			{ 
				b = a[u] + b;
				u++;

			}
			c[x] = b;
			b = 0;
		}
	}
	sort(c,c+(max1+1-min1));
		printf("%d", c[1]);
	return 0;
}