https://www.douyin.com/?recommend=1

https://www.crazygames.fr/jeu/holey-io-battle-royale

https://cn.bing.com/images/search?view=detailV2&ccid=fdzgjtLC&id=C26320CE280E9EF4E344BFEC34E0D48A7695A2EC&thid=OIP.fdzgjtLCKV3CwcaVJ4GIFgAAAA&mediaurl=https://ts1.tc.mm.bing.net/th/id/R-C.7ddce08ed2c2295dc2c1c69527818816?rik=7KKVdorU4DTsvw&riu=http%3a%2f%2fimg2.biaoqingjia.com%2fbiaoqing%2f201607%2f5489bd868b06d3301e6bbbf1b0ad2639.gif&ehk=2AqP5EXU7gJ58xgagsdZlldvVbEpaoRHF9OoxNPr%2fNI%3d&risl=&pid=ImgRaw&r=0&exph=300&expw=300&q=你是sb图片&FORM=IRPRST&ck=A55AD07606493E1F849B144BDAA446D2&selectedIndex=0&itb=0&idpp=overlayview&ajaxhist=0&ajaxserp=0

https://www.iduba.com/?f=msedgentab

include <bits/stdc++.h>

using namespace std; int a[10005], s[105], d[20010]; const int M = 1e9;

int main() {

int n, m;
cin >> n >> m;
memset(d, 0, sizeof(d));
for (int i = 0; i < m; i++)
	cin >> s[i];
for (int i = 0; i < n; i++)
	cin >> a[i];
for (int i = 0; i < n << 1; i++)
	d[i] = -M;
for (int i = 0; i < n + n; i++)
	for (int j = 1; j <= m; j++)
		if (i >= a[j])
			d[i] = max(d[i], d[i - a[j]] + s[i - a[j]]);
int maxn = -M;
for (int i = n; i < n * 2; i++) {
	maxn = max(maxn, d[i]);
}
cout << maxn;
return 0;

}