Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Binary Numbers AND Sum

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given two huge binary integer numbers $$$a$$$ and $$$b$$$ of lengths $$$n$$$ and $$$m$$$ respectively. You will repeat the following process: if $$$b > 0$$$, then add to the answer the value $$$a~ \&~ b$$$ and divide $$$b$$$ by $$$2$$$ rounding down (i.e. remove the last digit of $$$b$$$), and repeat the process again, otherwise stop the process.

The value $$$a~ \&~ b$$$ means bitwise AND of $$$a$$$ and $$$b$$$. Your task is to calculate the answer modulo $$$998244353$$$.

Note that you should add the value $$$a~ \&~ b$$$ to the answer in decimal notation, not in binary. So your task is to calculate the answer in decimal notation. For example, if $$$a = 1010_2~ (10_{10})$$$ and $$$b = 1000_2~ (8_{10})$$$, then the value $$$a~ \&~ b$$$ will be equal to $$$8$$$, not to $$$1000$$$.

Input

The first line of the input contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n, m \le 2 \cdot 10^5$$$) — the length of $$$a$$$ and the length of $$$b$$$ correspondingly.

The second line of the input contains one huge integer $$$a$$$. It is guaranteed that this number consists of exactly $$$n$$$ zeroes and ones and the first digit is always $$$1$$$.

The third line of the input contains one huge integer $$$b$$$. It is guaranteed that this number consists of exactly $$$m$$$ zeroes and ones and the first digit is always $$$1$$$.

Output

Print the answer to this problem in decimal notation modulo $$$998244353$$$.

Examples

Input

4 4

1010

1101

Output

12

Input

4 5

1001

10101

Output

11

Note

The algorithm for the first example:

- add to the answer $$$1010_2~ \&~ 1101_2 = 1000_2 = 8_{10}$$$ and set $$$b := 110$$$;
- add to the answer $$$1010_2~ \&~ 110_2 = 10_2 = 2_{10}$$$ and set $$$b := 11$$$;
- add to the answer $$$1010_2~ \&~ 11_2 = 10_2 = 2_{10}$$$ and set $$$b := 1$$$;
- add to the answer $$$1010_2~ \&~ 1_2 = 0_2 = 0_{10}$$$ and set $$$b := 0$$$.

So the answer is $$$8 + 2 + 2 + 0 = 12$$$.

The algorithm for the second example:

- add to the answer $$$1001_2~ \&~ 10101_2 = 1_2 = 1_{10}$$$ and set $$$b := 1010$$$;
- add to the answer $$$1001_2~ \&~ 1010_2 = 1000_2 = 8_{10}$$$ and set $$$b := 101$$$;
- add to the answer $$$1001_2~ \&~ 101_2 = 1_2 = 1_{10}$$$ and set $$$b := 10$$$;
- add to the answer $$$1001_2~ \&~ 10_2 = 0_2 = 0_{10}$$$ and set $$$b := 1$$$;
- add to the answer $$$1001_2~ \&~ 1_2 = 1_2 = 1_{10}$$$ and set $$$b := 0$$$.

So the answer is $$$1 + 8 + 1 + 0 + 1 = 11$$$.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2019 19:29:09 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|