#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 998244353;
const double pi = 3.1415926535897932, eps = 1e-6;
int n, m, f[505][505], pos[505][505], a[505];
int mul(int x, int y) { return (long long)x * y % mod; }
int dfs(int l, int r) {
  if (l >= r) return 1;
  int &res = f[l][r];
  if (res != -1) return res;
  res = 0;
  int p = pos[l][r];
  long long sum1 = 0, sum2 = 0;
  for (int(i) = (l); (i) <= (p); (i)++) {
    sum1 += mul(dfs(l, i - 1), dfs(i, p - 1));
    if (sum1 >= mod) sum1 -= mod;
  }
  for (int(i) = (p); (i) <= (r); (i)++) {
    sum2 += mul(dfs(p + 1, i), dfs(i + 1, r));
    if (sum2 >= mod) sum2 -= mod;
  }
  res = mul(sum1, sum2);
  return res;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int(i) = (1); (i) <= (m); (i)++) scanf("%d", a + i);
  for (int(i) = (1); (i) <= (m); (i)++) {
    pos[i][i] = i;
    for (int(j) = (i + 1); (j) <= (m); (j)++)
      if (a[j] < a[pos[i][j - 1]])
        pos[i][j] = j;
      else
        pos[i][j] = pos[i][j - 1];
  }
  for (int(i) = (1); (i) <= (m); (i)++)
    for (int(j) = (1); (j) <= (m); (j)++) f[i][j] = -1;
  printf("%d\n", dfs(1, m));
  return 0;
}
