Problem: D --Invisible

Problem Statement

You are trying to play a card game called "Invisible" with your friends. This card game uses two types of cards, a "scoring card" and a "jamming card". A positive value is written on each score card. The rules of this card game are as follows.

* The game is played by two players, player 1 and player 2. The game starts on player 1's turn.
* There is one stack and two decks in the field. The stack consists of cards placed by two players. In addition, the deck possessed by each player consists of the score card and the obstruction card possessed by that player. Players can check the order of cards in themselves or in their opponent's deck at any time. There are no cards on the stack at the beginning of the game.
* The two players alternately perform one of the following two actions exactly once.
* Put the top card of your deck on the top of the stack. However, this action cannot be performed when there are no cards in your deck.
* Pass your turn.
* When the player passes the turn, the following processing is performed.
* Each player gets all the scoring cards in the stack that meet the following two conditions. The score card obtained is removed from the field.
1. This is the score card you put on the stack.
2. Above any disturbing cards placed by your opponent (when there are no disturbing cards in your stack, the player gets all the cards he or she puts on the stack).
* Remove all cards in the stack.



If both players pass in succession with no cards on the stack, the game ends. The final score of each player is the sum of the numbers written on the score card obtained by each player.

Each player takes the best action to maximize the value obtained by subtracting the opponent's score from his own score. Your job is to calculate the difference between Player 1's score and Player 2's score when each player behaves optimally for each player's deck given.

Input

The input consists of a single test case of the form:

$ n $ $ m $
$ a_1 $ $ a_2 $ $ \ dots $ $ a_n $
$ b_1 $ $ b_2 $ $ \ dots $ $ b_m $

The first line consists of positive integers $ n $, $ m $ ($ 1 \ le n, m \ le 50 $) representing the number of decks. The second line consists of $ n $ integers, where $ a_i $ represents the $ i $ th card from the top of player 1's deck ($ 1 \ le i \ le n $). $ a_i $ is more than $ 1 $, less than $ 1 {,} 000 {,} 000 $, or $ -1 $. The third line consists of $ m $ integers, where $ b_j $ represents the $ j $ th card from the top of player 2's deck ($ 1 \ le j \ le m $). $ b_j $ is more than $ 1 $, less than $ 1 {,} 000 {,} 000 $, or $ -1 $. When $ a_i $ and $ b_j $ are positive integers, it represents a scoring card, and when it is $ -1 $, it represents a jamming card.

Output

Output (Score of Player 1)-(Score of Player 2) when each player behaves optimally.

Sample Input 1


twenty two
100 -1
200 300

Output for the Sample Input 1


-100

<image>
<image>
<image>


Sample Input 2


3 5
10 30 -1
-1 90 20 10 -1

Output for the Sample Input 2


0

Sample Input 3


4 5
15 20 10 30
50 30 10 20 25

Output for the Sample Input 3


-60





Example

Input

2 2
100 -1
200 300


Output

-100

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int N, M;
int a[50];
int b[50];
int dp[2][2][51][51][51][51];

const int INF = 1e9;

int f(int p, int pass, int ai, int an, int bi, int bn, int asum, int bsum) {
	int& d = dp[p][pass][ai][an][bi][bn];
	if(d != INF) return d;
	// pass
	int s = asum - bsum;
	int npass = pass;
	if(an == 0 && bn == 0) npass++;

	if(p == 0) {
		d = -INF;
		if(npass == 2) {
			d = max(d, s);
		}
		else {
			d = max(d, s + f(1 - p, npass, ai, 0, bi, 0, 0, 0));
		}
		// put
		if(ai < N) {
			int nasum = asum, nbsum = bsum;
			if(a[ai] == -1) nbsum = 0;
			else nasum += a[ai];
			d = max(d, f(1 - p, 0, ai + 1, an + 1, bi, bn, nasum, nbsum));
		}
	}
	else {
		d = INF;
		if(npass == 2) {
			d = min(d, s);
		}
		else {
			d = min(d, s + f(1 - p, npass, ai, 0, bi, 0, 0, 0));
		}
		// put
		if(bi < M) {
			int nasum = asum, nbsum = bsum;
			if(b[bi] == -1) nasum = 0;
			else nbsum += b[bi];
			d = min(d, f(1 - p, 0, ai, an, bi + 1, bn + 1, nasum, nbsum));
		}
	}
	return d;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(cin >> N >> M) {
		for(int i = 0; i < N; i++) {
			cin >> a[i];
		}
		for(int i = 0; i < M; i++) {
			cin >> b[i];
		}
		fill((int*)begin(dp), (int*)end(dp), INF);
		cout << f(0, 0, 0, 0, 0, 0, 0, 0) << endl;
	}
}