#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint998244353;
mint dp[202][202][202];
mint dps[202][202][202];
mint dp1[202][202][202], dps1[202][202][202];
int main()
{
    int n, k; cin>>n>>k;
    for(int i=0; i<k; i++) for(int j=0; j<k; j++){
        if(i==j) continue;
        dp[2][i][j]=1;
        dps[2][i][j]=i+j;
        dp1[2][i+1][j]=dp1[2][i][j]+dp[2][i][j];
        dps1[2][i+1][j]=dps1[2][i][j]+dps[2][i][j];
    }
    for(int i=2; i<n; i++){
        for(int j=0; j<k; j++){
            for(int l=0; l<k; l++){
                if(j==l) continue;
                if(j<l){
                    dp[i+1][j][l]+=dp1[i][k][j]-dp1[i][j+1][j]-dp[i][l][j];
                    dps[i+1][j][l]+=dps1[i][k][j]-dps1[i][j+1][j]-dps[i][l][j]+(dp1[i][k][j]-dp1[i][j+1][j]-dp[i][l][j])*mint(l);
                }else{
                    dp[i+1][j][l]+=dp1[i][j][j]-dp[i][l][j];
                    dps[i+1][j][l]+=dps1[i][j][j]-dps[i][l][j]+(dp1[i][j][j]-dp[i][l][j])*mint(l);
                }
                dp1[i+1][j+1][l]=dp1[i+1][j][l]+dp[i+1][j][l];
                dps1[i+1][j+1][l]=dps1[i+1][j][l]+dps[i+1][j][l];
            }
        }
    }
    mint ans1=0, ans2=0;
    for(int i=0; i<k; i++) for(int j=0; j<k; j++) ans1+=dp[n][i][j], ans2+=dps[n][i][j];
    cout<<ans1.val()<<" "<<ans2.val()<<endl;
    return 0;
}