#pragma GCC optimize("Ofast") #include using namespace std; typedef long long int ll; typedef unsigned long long int ull; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); ll myRand(ll B) { return (ull)rng() % B; } inline double time() { return static_cast(chrono::duration_cast(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; vector f(n+1, 1); int cur = 0; int m; cin >> m; for (int i = 0; i < m; ++i) { int a; cin >> a; cur += a; f[cur] = 0; } cin >> m; for (int i = 0; i < m; ++i) { int a; cin >> a; cur -= a; f[cur] = 0; } int res = 0; for (int i = 0; i < n; ++i) { res += f[i]; } cout << res << endl; }