#include <bits/stdc++.h>
#pragma GCC optimize(2)
namespace OI {
template <class T>
T gcd(T x, T y) {
  return !y ? x : gcd(y, x % y);
}
template <class T>
T Fabs(T x) {
  return x < 0 ? -x : x;
}
template <class T>
void rd(T &x) {
  x = 0;
  int pre = 1;
  char c;
  while (!isdigit(c = getchar()))
    if (c == '-') pre = -1;
  do {
    x = (x << 3) + (x << 1) + (c ^ 48);
  } while (isdigit(c = getchar()));
  x *= pre;
}
template <class T>
void pt(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) pt(x / 10);
  putchar(x % 10 ^ 48);
}
}  // namespace OI
using namespace OI;
using namespace std;
const int N = 505, mod = 998244353;
int n, m, a[N], dp[N][N];
int dfs(int l, int r) {
  if (l > r) return 1;
  if (dp[l][r]) return dp[l][r];
  int p = l, t = 0;
  for (int i = l; i <= r; i++)
    if (a[i] < a[p]) p = i;
  for (int i = l; i <= p; i++)
    t = (t + 1ll * dfs(l, i - 1) * dfs(i, p - 1) % mod) % mod;
  for (int i = p; i <= r; i++)
    dp[l][r] =
        (dp[l][r] + 1ll * t * dfs(p + 1, i) % mod * dfs(i + 1, r) % mod) % mod;
  return dp[l][r];
}
int main() {
  rd(n), rd(m);
  for (int i = 1; i <= n; i++) rd(a[i]);
  pt(dfs(1, n));
  return 0;
}
