#include <bits/stdc++.h>
using namespace std;
namespace fast_IO {
const int IN_LEN = 10000000, OUT_LEN = 10000000;
char ibuf[IN_LEN], obuf[OUT_LEN], *ih = ibuf + IN_LEN, *oh = obuf,
                                  *lastin = ibuf + IN_LEN,
                                  *lastout = obuf + OUT_LEN - 1;
inline char getchar_() {
  return (ih == lastin) &&
                 (lastin = (ih = ibuf) + fread(ibuf, 1, IN_LEN, stdin),
                  ih == lastin)
             ? EOF
             : *ih++;
}
inline void putchar_(const char x) {
  if (oh == lastout) fwrite(obuf, 1, oh - obuf, stdout), oh = obuf;
  *oh++ = x;
}
inline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }
int read() {
  int x = 0;
  int zf = 1;
  char ch = ' ';
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar_();
  if (ch == '-') zf = -1, ch = getchar_();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar_();
  return x * zf;
}
void write(long long x) {
  if (x < 0) putchar_('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar_(x % 10 + '0');
}
}  // namespace fast_IO
using namespace fast_IO;
const int MOD = 998244353;
long long f[505][505], a[505];
int main() {
  int n = read(), m = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  for (int i = 1; i <= n + 1; ++i) f[i][i] = f[i][i - 1] = 1;
  for (int len = 2; len <= n; ++len) {
    for (int i = 1, j = len; j <= n; ++i, ++j) {
      int pos = min_element(a + i, a + j + 1) - a;
      int val1 = 0, val2 = 0;
      for (int k = i; k <= pos; k++)
        (val1 += f[i][k - 1] * f[k][pos - 1] % MOD) %= MOD;
      for (int k = pos; k <= j; k++)
        (val2 += f[pos + 1][k] * f[k + 1][j] % MOD) %= MOD;
      f[i][j] = (long long)(val1)*val2 % MOD;
    }
  }
  write(f[1][n]);
  flush();
  return 0;
}
