#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


namespace po167{
//LCP vec[0,n) and vec[i,n)
//for all i 
//O(vec.size())
template<class T>
std::vector<int> Z_algo(std::vector<T> &vec){
	int n=vec.size();
	int ind=1,j=0,k;
	std::vector<int> ans(n,0);
	ans[0]=n;
	while(ind<n){
		while(ind+j<n&&vec[j]==vec[ind+j]) j++;
		ans[ind]=j;
		if(j==0){
			ind++;
			continue;
		}
		k=1;
		while(k+ind<n&&ans[k]+k<j){
			ans[k+ind]=ans[k];
			k++;
		}
		j-=k;
		ind+=k;
	}
	return ans;
}
std::vector<int> Z_algo(std::string &vec){
	int n=vec.size();
	int ind=1,j=0,k;
	std::vector<int> ans(n,0);
	ans[0]=n;
	while(ind<n){
		while(ind+j<n&&vec[j]==vec[ind+j]) j++;
		ans[ind]=j;
		if(j==0){
			ind++;
			continue;
		}
		k=1;
		while(k+ind<n&&ans[k]+k<j){
			ans[k+ind]=ans[k];
			k++;
		}
		j-=k;
		ind+=k;
	}
	return ans;
}
}
using po167::Z_algo;

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	ll N,M;
	cin>>N>>M;
	vector<int> A(N),B(M);
	vector<ll> C(M+1);
	rep(i,0,N) cin>>A[i];
	rep(i,0,M) cin>>B[i];
	rep(i,0,M) cin>>C[i];
	auto p=A;
	p.push_back(-1);
	rep(i,0,M) p.push_back(B[i]);
	auto tmp=Z_algo(p);
	vector<int> Z(M);
	rep(i,0,M) Z[i]=tmp[N+i+1];
	vector<vector<int>> H(M+1);
	rep(i,0,M) H[i+Z[i]].push_back(i);
	vector<ll> dp(M+1,ILL);
	vector<bool> ok(M+1);
	vector<int> order(M);
	rep(i,0,M) order[i]=i;
	sort(all(order),[&](int l,int r){
		return C[l]>C[r];
	});
	dp[0]=0;
	ok[0]=1;
	int Q=700;
	vector<int> ch;
	rep(i,1,M+1){
		if((i-1)%Q==0){
			int L=i,R=min(i+Q,M+1);
			ch.clear();
			vector<int> lis;
			rep(j,0,M){
				int a=order[j];
				if(L<=a&&a<R) ch.push_back(a);
				else if(ok[a]){
					if(a+Z[a]<R) ch.push_back(a);
					else{
						if(!lis.empty()){
							int ind=lis.size();
							ind-=1;
							if(C[lis[ind]]==C[a]){
								if(dp[lis[ind]]>dp[a]) lis[ind]=a;
							}
							else lis.push_back(a);
						}
						else lis.push_back(a);
					}
				}
			}
			vector<int> st;
			int k=-1;
			// (a/b)<=(c/d) ?
			auto f=[](ll a,ll b,ll c,ll d)->bool{
				ll x1=a/b,x2=c/d;
				if(x1!=x2) return x1<x2;
				a-=x1*b;
				c-=x2*d;
				return a*d<=c*b;
			};
			for(auto c:lis){
				while(1<=k){
					int a=st[k-1];
					int b=st[k];
					if(f(dp[c]-dp[a],C[a]-C[c],dp[b]-dp[a],C[b]-C[c])){
						k--;
					}
					else break;
				}
				k++;
				st.push_back(c);
			}
			int ind=0;
			if(k!=-1){
				rep(j,L,R){
					while(ind!=k){
						int a=st[ind];
						int b=st[ind+1];
						if(dp[a]+j*C[a]<=dp[b]+j*C[b]) break;
						ind++;
					}
					dp[j]=dp[st[ind]]+j*C[st[ind]];
				}
			}
		}
		for(auto x:ch){
			if(ok[x]){
				chmin(dp[i],dp[x]+C[x]*i);
			}
		}
		//cout<<i<<" "<<dp[i]<<endl;
		dp[i]-=i*C[i];
		ok[i]=1;
		for(auto z:H[i]) ok[z]=0;
	}
	cout<<(dp[M]==ILL?-1:dp[M])<<"\n";
}