#include<bits/stdc++.h>
#define COGS
using namespace std;
const int maxn=110;
int cost[11],n;
int f[maxn];
inline void in(){
	#ifdef COGS
	freopen("busses.in","r",stdin);
	freopen("busses.out","w",stdout);
	#endif
	for (int i=1;i<=10;i++){
		scanf("%d",&cost[i]);
	}
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		f[i]=2000000;
	}
}
inline void dp(){
	for (int v=0;v<=n;v++){
		for (int j=1;j<=10;j++){
			if (v>=j) f[v]=min(f[v],f[v-j]+cost[j]);
		}
	}
}
inline void p(){
	printf("%d",f[n]);
}
int Main(){
	in();
	dp();
	p();
	return 0;
}
int main(){;}
int xlm=Main();