A11573 | Intercepted Message

Hacker Zhorik wants to decipher two secret messages he intercepted yesterday. Yeah message is a sequence of encrypted blocks, each of them consists of several bytes of information.

Zhorik knows that each of the messages is an archive containing one or more files. Zhorik knows how each of these archives was transferred through the network: if an archive consists of $k$ files of sizes $l_{1},l_{2},...,l_{k}$ bytes, then the $i$ -th file is split to one or more blocks $b_{i,1},b_{i,2},...,b_{i,mi}$ (here the total length of the blocks $b_{i,1}+b_{i,2}+...+b_{i,mi}$ is equal to the length of the file $l_{i}$ ), and after that all blocks are transferred through the network, maintaining the order of files in the archive.

Zhorik thinks that the two messages contain the same archive, because their total lengths are equal. However, each file can be split in blocks in different ways in the two messages.

You are given the lengths of blocks in each of the two messages. Help Zhorik to determine what is the maximum number of files could be in the archive, if the Zhorik's assumption is correct.

The first line contains two integers $n$ , $m$ ( $1<=n,m<=10^{5}$ ) — the number of blocks in the first and in the second messages.

The second line contains $n$ integers $x_{1},x_{2},...,x_{n}$ ( $1<=x_{i}<=10^{6}$ ) — the length of the blocks that form the first message.

The third line contains $m$ integers $y_{1},y_{2},...,y_{m}$ ( $1<=y_{i}<=10^{6}$ ) — the length of the blocks that form the second message.

It is guaranteed that $x_{1}+...+x_{n}=y_{1}+...+y_{m}$ . Also, it is guaranteed that $x_{1}+...+x_{n}<=10^{6}$ .

Print the maximum number of files the intercepted array could consist of.