#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef vector<int> vi;
typedef pair<int,int> pi;

const int N=2e5+5;
int n,m,a[N],b[N];
int s[N][2];
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	cin>>n>>m;
	rep(i,1,n){
		cin>>a[i];
	}
	rep(i,1,m){
		cin>>b[i];
	}
	int mn=*min_element(b+1,b+m+1);
	
	vi stk;
	rep(i,1,n){
		int ls=0;
		while(!stk.empty() && a[stk.back()]<=a[i]){
			ls=stk.back();
			stk.pop_back();
		}
		if(!stk.empty()){
			s[stk.back()][1]=i;
		}
		s[i][0]=ls;
		stk.pb(i);
	}
	long long ans=0;
	auto dfs=[&](auto self,int u,int L,int R)->void{
		if(!u){
			return;
		}
		if(mn+a[u]<0){
			return;
		}
		int le=u,ri=u;
		while(le>L && a[le-1]+b[1]>=0){
			le--;
		}
		while(ri<R && a[ri+1]+b[m]>=0){
			ri++;
		}
		ans+=(long long)(ri-u+1)*(u-le+1);
		self(self,s[u][0],L,u-1);
		self(self,s[u][1],u+1,R);
	};
	dfs(dfs,stk.back(),1,n);
	cout<<ans<<'\n';
}