// URL: https://yukicoder.me/problems/no/1513

import std;

version(unittest) {} else
void main()
{
  int N, K; io.getV(N, K);

  auto dp1 = new mint[][][](N, K, K), dp2 = new mint[][][](N, K, K);
  foreach (j; 0..K)
    foreach (k; 0..K)
      if (j != k) {
        dp1[1][j][k] = 1;
        dp2[1][j][k] = j+k;
      }

  foreach (i; 1..N-1)
    foreach (j; 0..K) {
      auto b1 = new mint[](K), b2 = new mint[](K);
      foreach (l; 0..K) {
        b1[l] = dp1[i][l][j];
        b2[l] = dp2[i][l][j];
      }
      auto c1 = b1.cumulativeSum, c2 = b2.cumulativeSum;
      foreach (k; 0..K) {
        if (j > k) {
          dp1[i+1][j][k] = c1[0..j] - dp1[i][k][j];
          dp2[i+1][j][k] = c2[0..j] - dp2[i][k][j] + dp1[i+1][j][k]*k;
        } else if (j < k) {
          dp1[i+1][j][k] = c1[j+1..K] - dp1[i][k][j];
          dp2[i+1][j][k] = c2[j+1..K] - dp2[i][k][j] + dp1[i+1][j][k]*k;
        }
      }
    }

  auto ans1 = mint(0), ans2 = mint(0);
  foreach (j; 0..K)
    foreach (k; 0..K) {
      ans1 += dp1[$-1][j][k];
      ans2 += dp2[$-1][j][k];
    }

  io.put(ans1, ans2);
}

const mod = 998244353;
alias mint = ModInt!mod;

class CumulativeSum(T)
{
  const size_t n;
  T[] s;

  pure nothrow @safe
  {
    this(T[] a)
    {
      n = a.length;
      s = new T[](n+1);
      s[0] = 0;
      foreach (i; 0..n) s[i+1] = s[i]+a[i];
    }
  }

  pure nothrow @nogc @safe
  {
    T opSlice(size_t l, size_t r) const
      in { assert(0 <= l && l <= r && r <= n); }
    do
    {
      return s[r]-s[l];
    }
    size_t opDollar() const
    {
      return n;
    }
  }
}

pure nothrow @safe
{
  auto cumulativeSum(T)(T[] a)
  {
    return new CumulativeSum!T(a);
  }
}
pure nothrow @safe
{
  T powr(alias pred = "a*b", T, U)(const T a, U n, T one)
    if (isIntegral!U)
  {
    auto b = T(a);
    alias predFun = binaryFun!pred;
    if (n == 0) return one;
    auto r = one;
    for (; n > 0; n >>= 1) {
      if (n&1) r = predFun(r, b);
      b = predFun(b, b);
    }
    return r;
  }
  T powr(alias pred = "a*b", T, U)(const T a, U n)
    if (isIntegral!U)
  {
    return powr!(pred, T, U)(a, n, T(1));
  }
}

pragma(inline) pure nothrow @nogc @safe
{
  T cdiv(T)(const T a, const T b)
  {
    return (a+b-1)/b;
  }
  T pmod(T)(const T a, const T b)
  {
    return a >= 0 ? a%b : a%b+b;
  }
}

pure nothrow @nogc @safe
{
  ExtGcdResult!T extGcd(T)(const T a, const T b)
  {
    if (a == 0) {
      return ExtGcdResult!T(T(b), T(0), T(1));
    } else {
      auto r = extGcd(b%a, a);
      return ExtGcdResult!T(r.gcd, r.y-(b/a)*r.x, r.x);
    }
  }

  private struct ExtGcdResult(T)
  {
    T gcd, x, y;
  }
}

struct ModInt(int m)
{
  pragma(inline) pure nothrow @nogc @safe
  {
    this(T)(T v)
      if (isIntegral!T)
    {
      i = nm(v);
    }
    this(ref return scope const Mint v)
    {
      i = v.i;
    }
    bool opEquals(T)(T v) const
      if (isIntegral!T)
    {
      return i == v;
    }
    bool opEquals(const Mint v) const
    {
      return i == v.i;
    }

    Mint opUnary(string op: "-")() const
    {
      return Mint(-i);
    }

    static if (m < int.max/2) {
      Mint opBinary(string op: "+")(int r) const
      {
        Mint m;
        m.i = nm(i+r);
        return m;
      }
      Mint opBinary(string op: "+")(const Mint r) const
      {
        Mint m;
        m.i = nmp(i+r.i);
        return m;
      }
      ref Mint opOpAssign(string op: "+")(int r)
      {
        i = nm(i+r);
        return this;
      }
      ref Mint opOpAssign(string op: "+")(const Mint r)
      {
        i = nmp(i+r.i);
        return this;
      }
    } else {
      Mint opBinary(string op: "+")(int r) const
      {
        Mint m;
        m.i = nm(l+r);
        return m;
      }
      Mint opBinary(string op: "+")(const Mint r) const
      {
        Mint m;
        m.i = nmp(l+r.i);
        return m;
      }
      ref Mint opOpAssign(string op: "+")(int r)
      {
        i = nm(l+r);
        return this;
      }
      ref Mint opOpAssign(string op: "+")(const Mint r)
      {
        i = nmp(l+r.i);
        return this;
      }
    }
    Mint opBinary(string op: "-")(int r) const
    {
      return Mint(i-r);
    }
    Mint opBinary(string op: "-")(const Mint r) const
    {
      return Mint(i-r.i);
    }
    ref Mint opOpAssign(string op: "-")(int r)
    {
      i = nm(i-r);
      return this;
    }
    ref Mint opOpAssign(string op: "-")(const Mint r)
    {
      i = nm(i-r.i);
      return this;
    }

    Mint opBinary(string op, T)(T r) const
      if ((op == "+" || op == "-") && isIntegral!T && !is(T == int))
    {
      return Mint(mixin("l"~op~"r"));
    }
    ref Mint opOpAssign(string op, T)(T r)
      if ((op == "+" || op == "-") && isIntegral!T && !is(T == int))
    {
      i = nm(mixin("l"~op~"r"));
      return this;
    }

    Mint opBinary(string op: "*", T)(T r) const
      if (isIntegral!T)
    {
      Mint m;
      m.i = nm(l*r);
      return m;
    }
    Mint opBinary(string op: "*")(const Mint r) const
    {
      Mint m;
      m.i = nmp(l*r.i);
      return m;
    }
    ref Mint opOpAssign(string op: "*", T)(T r)
      if (isIntegral!T)
    {
      i = nm(l*r);
      return this;
    }
    ref Mint opOpAssign(string op: "*")(const Mint r)
    {
      i = nmp(l*r.i);
      return this;
    }

    ref Mint opUnary(string op: "++")()
    {
      i = nmp(i+1);
      return this;
    }
    ref Mint opUnary(string op: "--")()
    {
      i = nm(i-1);
      return this;
    }

    Mint opBinary(string op: "^^", T)(T n)
      if (isIntegral!T)
    {
      return powr(this, n, Mint(1));
    }

    Mint opBinary(string op: "/")(const Mint r) const
    {
      return Mint(l*r.inv.i);
    }
    ref Mint opOpAssign(string op: "/")(const Mint r)
    {
      i = nm(l*r.inv.i);
      return this;
    }

    Mint opBinary(string op: "/", T)(T r) const
      if (isIntegral!T)
    {
      return opBinary!op(Mint(r));
    }
    ref Mint opOpAssign(string op: "/", T)(T r)
      if (isIntegral!T)
    {
      return opOpAssign!op(Mint(r));
    }

    Mint inv() const
    {
      return Mint(extGcd(i, m).x);
    }
  }

  pure nothrow @nogc @safe
  {
    ref Mint opAssign(T)(T v)
      if (isIntegral!T)
    {
      i = nm(v);
      return this;
    }
    ref Mint opAssign(const Mint v)
    {
      i = v.i;
      return this;
    }
  }

  pure nothrow @safe
  {
    string toString() const
    {
      return i.to!string;
    }
  }

  private
  {
    alias Mint = ModInt!m;
    version(BigEndian) union { long l; struct { int i2; int i; } }
    else union { long l; int i; }

    pragma(inline) pure nothrow @nogc @safe
    {
      int nm(T)(T v) const
        if (isIntegral!T)
      {
        return cast(int)pmod(v, m);
      }
      int nmp(T)(T v) const
        if (isIntegral!T)
      {
        return cast(int)(v%m);
      }
    }
  }
}

auto io = IO!()();
struct IO(alias IN = stdin, alias OUT = stdout)
{
  import core.stdc.stdlib : exit;

  void getV(T...)(ref T v)
  {
    foreach (ref w; v) get(w);
  }
  void getA(T)(size_t n, ref T v)
    if (hasAssignableElements!T)
  {
    v = new T(n);
    foreach (ref w; v) get(w);
  }
  void getC(T...)(size_t n, ref T v)
    if (allSatisfy!(hasAssignableElements, T))
  {
    foreach (ref w; v) w = new typeof(w)(n);
    foreach (i; 0..n) foreach (ref w; v) get(w[i]);
  }
  void getM(T)(size_t r, size_t c, ref T v)
    if (hasAssignableElements!T && hasAssignableElements!(ElementType!T))
  {
    v = new T(r);
    foreach (ref w; v) getA(c, w);
  }
  template getS(E...)
  {
    void getS(T)(size_t n, ref T v)
    {
      v = new T(n);
      foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");
    }
  }

  const struct PutConf
  {
    bool newline = true, flush, exit;
    string floatFormat = "%.10f", delimiter = " ";
  }

  void put(alias conf = "{}", T...)(T v)
  {
    putMain!conf(v);
  }
  void putB(alias conf = "{}", S, T)(bool c, S t, T f)
  {
    if (c) put!conf(t);
    else put!conf(f);
  }
  void putRaw(T...)(T v)
  {
    OUT.write(v);
    OUT.writeln;
  }

  private
  {
    dchar[] buf;
    auto sp = (new dchar[](0)).splitter;

    void nextLine()
    {
      IN.readln(buf);
      sp = buf.splitter;
    }
    void get(T)(ref T v)
    {
      if (sp.empty) nextLine();
      v = sp.front.to!T;
      sp.popFront();
    }

    void putMain(alias conf, T...)(T v)
    {
      mixin("const PutConf c = "~conf~";");
      foreach (i, w; v) {
        putOne!conf(w);
        if (i+1 < v.length) OUT.write(c.delimiter);
      }
      static if (c.newline) OUT.writeln;
      static if (c.flush) OUT.flush();
      static if (c.exit) exit(0);
    }
    void putOne(alias conf, T)(T v)
    {
      mixin("const PutConf c = "~conf~";");
      static if (isInputRange!T && !isSomeString!T) putRange!conf(v);
      else static if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v));
      else static if (hasMember!(T, "fprint")) v.fprint(OUT);
      else OUT.write(v);
    }
    void putRange(alias conf, T)(T v)
    {
      mixin("const PutConf c = "~conf~";");
      auto w = v;
      while (!w.empty) {
        putOne!conf(w.front); w.popFront();
        if (!w.empty) OUT.write(c.delimiter);
      }
    }
  }
}