#JGY104. 按位异或1

按位异或1

当前没有测试数据。

Background

给定两个正整数 nnmm,请你求出:

$$\left(\sum\limits_{x_1=0}^{n}\sum\limits_{x_2=0}^{m}x_1\;\text{xor}\;x_2\right)\!\!\!\!\!\mod 998244353 $$

的值。

Description

Given two integers x and y, print the sum.

Format

Input

Two integers x and y, satisfying 0x,y327670\leq x,y\leq 32767 .

Output

One integer, the sum of x and y.

Samples

123 500
623

Limitation

1s, 1024KiB for each test case.