Codeforces869C-The Intriguing Obsession

The Intriguing Obsession

— This is not playing but duty as allies of justice, Nii-chan!

— Not allies but justice itself, Onii-chan!

With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters — Karen and Tsukihi — is heading for somewhere they've never reached — water-surrounded islands!

There are three clusters of islands, conveniently coloured red, blue and purple. The clusters consist of a, b and c distinct islands respectively.

Bridges have been built between some (possibly all or none) of the islands. A bridge bidirectionally connects two different islands and has length 1. For any two islands of the same colour, either they shouldn't be reached from each other through bridges, or the shortest distance between them is at least 3, apparently in order to prevent oddities from spreading quickly inside a cluster.

The Fire Sisters are ready for the unknown, but they'd also like to test your courage. And you're here to figure out the number of different ways to build all bridges under the constraints, and give the answer modulo 998 244 353. Two ways are considered different if a pair of islands exist, such that there's a bridge between them in one of them, but not in the other.

Input

The first and only line of input contains three space-separated integers a, b and c (1 ≤ a, b, c ≤ 5 000) — the number of islands in the red, blue and purple clusters, respectively.

Output

Output one line containing an integer — the number of different ways to build bridges, modulo 998 244 353.

Example

Input

1 1 1

Output

8

Input

1 2 2

Output

63

Input

1 3 5

Output

3264

Input

6 2 9

Output

813023575

Note

In the first example, there are 3 bridges that can possibly be built, and no setup of bridges violates the restrictions. Thus the answer is 2³ = 8.

In the second example, the upper two structures in the figure below are instances of valid ones, while the lower two are invalid due to the blue and purple clusters, respectively.

这题的题面很复杂，但我们可以把它拆成3个子问题：求两种岛之间连线的方案数，我们发现这可以用Dp求解。我们设dp[i][j]表示i座第一种岛和j座第二种岛连线的方案数。推出状态转移方程：dp[i][j]=dp[i-1][j]（第i座岛不选）+dp[i-1,j-1]*j（第i座岛选）。ans=dp[a][b]*dp[b][c]*dp[c][a]。

Code：

uses math;
const m=998244353;
var
  a,b,c,maxans,i,j:longint;
  dp:array[0..5005,0..5005] of int64;
begin
  readln(a,b,c);
  maxans:=max(max(a,b),c);
  for i:=1 to maxans do
  begin
    dp[i,1]:=i+1;
    dp[1,i]:=i+1;
  end;
  for i:=2 to maxans do
    for j:=2 to maxans do
      dp[i,j]:=(dp[i-1,j-1]*j+dp[i-1,j]) mod m;
  writeln(((dp[a,b] mod m)*dp[b,c] mod m)*dp[c,a] mod m);
end.