F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Competition

Time Limit: 24000/12000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 159    Accepted Submission(s): 28


Problem Description
You participated in a competition and you have a number $V$ with an initial value of $0$ and a score $W$ with an initial value of $1$. When you win the game, firstly $V = V+2$, secondly $ W=W* V$ ; when you lose the game, $V=V-1 $.

Now you only know that you have won $n$ games and lost $m$ games.

Please find the sum of $W$ module $998244353$ for all possible situations.

Two situations are considered different if and only if the winning/losing sequences are different.
 

Input
The first line contains two integers $n, m$.

$2\leq n\leq 5*10^4,\ 1\le m \le 10^5$
 

Output
Output an integer represent the answer.
 

Sample Input
5 5
 

Sample Output
133035
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-03 12:28:40, Gzip enabled