#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MOD = 998244353 ;

ll n , m ;

ll fastpow ( ll x , ll pw ) {
    ll ret = 1 ;
    while ( pw > 0 ) {
        if ( ( pw % 2 ) == 0 ) {
            x = ( x * x ) % MOD ;
            pw /= 2 ;
        }
        else {
            ret = ( ret * x ) % MOD ;
            -- pw ;
        }
    }
    return ret ;
}

ll comb ( ll up , ll down ) {
    if ( up < down || down < 0 ) { return 0 ; }
    ll ret = 1 ;
    for ( ll i = 0 ; i < down ; ++ i ) {
        ret = ( ret * ( up - i ) ) % MOD ;
    }
    for ( ll i = 1 ; i <= down ; ++ i ) {
        ret = ( ret * fastpow ( i , MOD - 2 ) ) % MOD ;
    }
    return ret ;
}

void solve ( ) {
    cin >> n >> m ;
    ll ans = ( comb ( n , 4 ) * comb ( m , 4 ) ) % MOD ;

    ll aux = ( comb ( m , 4 ) * comb ( n , 2 ) ) % MOD ;
    aux = ( aux * comb ( n , 2 ) ) % MOD ;
    ans = ( ans + aux ) % MOD ;

    aux = ( comb ( n , 4 ) * comb ( m , 2 ) ) % MOD ;
    aux = ( aux * comb ( m , 2 ) ) % MOD ;
    ans = ( ans + aux ) % MOD ;

    aux = ( comb ( n , 4 ) * comb ( m , 4 ) ) % MOD ;
    aux = ( aux * 2 ) % MOD ;
    ans = ( ans + MOD - aux ) % MOD ;

    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}