Xyene wants to bake two cakes to celebrate the new year. Unfortunately, he does not have proper equipment with which to precisely measure ingredients, but since he'll be baking two identical cakes all he needs to measure are two equal amounts of ingredients. Therefore, he's decided to use a weighing scale to measure the ingredients he'll need.

He's placed items on the left side of his scale and on the right, until he had an **equal** amount (by weight) on both sides. Now, Xyene wants to unload the scale, and begin baking! At any step in his unloading process, he may remove any number of items from **one** side of the scale. However, if the scale is ever off balance by more than grams, it will tip over, and all the expensive ingredients on it will fall off!

Xyene wants to unload the scale in such a way that it never loses balance. If he unloads optimally, how many steps will it take for Xyene to completely unload the weighing scale?

#### Constraints

For all cases, .

##### Subtask 1 [20%]

##### Subtask 2 [80%]

#### Input Specification

The first line of input will contain , and .

The second line of input will contain space-separated integers representing the weight of the ingredients on the left side of the balance, with the representing the weight in grams of the ingredient.

The third line of input will contain space-separated integers representing the right side of the balance, given in the same format as the left side.

#### Output Specification

A single integer, the number of steps required to unload the balance. Since Xyene was able to load all the ingredients onto the scale, it is guaranteed that there must exist some way to unload the scale with it maintaining balance.

#### Sample Input 1

```
2 2 2
1 2
2 1
```

#### Sample Output 1

`3`

#### Explanation

Xyene can start from either side. Starting from the left, he removes . Next, he removes from the right side, before removing from the left side.

#### Sample Input 2

```
3 2 2
1 1 1
1 2
```

#### Sample Output 2

`3`

#### Explanation

Xyene removes off of the right side, followed by from the left side. Finally, he removes from the right side.

#### Sample Input 3

```
2 4 3
1 3
1 1 1 1
```

#### Sample Output 3

`3`

#### Sample Input 4

```
10 10 10
1 2 3 4 5 6 7 8 9 10
1 2 3 4 5 6 7 8 9 10
```

#### Sample Output 4

`7`

## Comments

Is sorting involved in this?

Explanation of the forth sample please? i see it should be 8 not 7

first take 10 from left, 10 1 9 from right, 1 9 2 8 from left, 2 8 3 7 from right, 3 7 4 6 from left, 4 5 6 from right, 5 from left.