#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> N >> M; vector u(N); REP(i,N) cin >> u[i]; dp[0]=1; REP(i,M){ ll x; cin >> x; for(j=100000;j>=0;j--){ if(dp[j]) dp[j+x]=1; } } set c; REP(i,N){ for(j=0;j<100010;j++){ if(dp[j]) c.insert(u[i]+j); } } cout << (ll)c.size() << endl; return 0; }