#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int arr = 2e5 + 10;
const int ar = 2e3 + 10;
const long double pi = acos(-1);
const long double eps = 1e-10;
const long long md = 1e9 + 7;
int a[(int)(500 + 10)];
int dp[(int)(500 + 10)][(int)(500 + 10)];
int get_dp(int l, int r) {
  if (l > r) {
    return 1;
  }
  if (l == r) {
    return 1;
  }
  if (dp[l][r] != -1) {
    return dp[l][r];
  }
  dp[l][r] = 0;
  int pos = min_element(a + l, a + r + 1) - a;
  int sum1 = 0;
  int sum2 = 0;
  for (int k = l; k <= pos; k++) {
    sum1 +=
        1ll * get_dp(l, k - 1) * get_dp(k, pos - 1) % (long long)(998244353ll);
    if (sum1 >= (long long)(998244353ll)) {
      sum1 -= (long long)(998244353ll);
    }
  }
  for (int p = pos; p <= r; p++) {
    sum2 +=
        1ll * get_dp(pos + 1, p) * get_dp(p + 1, r) % (long long)(998244353ll);
    if (sum2 >= (long long)(998244353ll)) {
      sum2 -= (long long)(998244353ll);
    }
  }
  dp[l][r] = 1ll * sum1 * sum2 % (long long)(998244353ll);
  return dp[l][r];
}
int main() {
  for (int i = 0; i < (int)(500 + 10); i++) {
    for (int j = i; j < (int)(500 + 10); j++) {
      dp[i][j] = -1;
    }
  }
  int n;
  cin >> n >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  cout << get_dp(1, n) << "\n";
}
