#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = (long long)INF * INF;
const int mod = 998244353;
const int MAX = 1 << 9;
void ADD(int& x, int val) {
  x += val;
  if (x >= mod) x -= mod;
}
int mult(int a, int b) { return (long long)a * b % mod; }
int c[MAX];
int mn[MAX][MAX];
int dp[MAX][MAX];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = (0); i < (m); ++i) cin >> c[i];
  for (int l = (0); l < (m); ++l) {
    mn[l][l] = l;
    for (int r = (l + 1); r < (m); ++r)
      mn[l][r] = c[r] < c[mn[l][r - 1]] ? r : mn[l][r - 1];
  }
  for (int i = (0); i < (m + 1); ++i) dp[i + 1][i] = 1;
  for (int len = (1); len < (m + 1); ++len) {
    for (int l = (0); l < (m + 1 - len); ++l) {
      int r = l + len - 1;
      int s1 = 0, s2 = 0;
      for (int i = (l); i < (mn[l][r] + 1); ++i)
        ADD(s1, mult(dp[l + 1][i], dp[i + 1][mn[l][r]]));
      for (int i = (mn[l][r]); i < (r + 1); ++i)
        ADD(s2, mult(dp[mn[l][r] + 2][i + 1], dp[i + 2][r + 1]));
      dp[l + 1][r + 1] = mult(s1, s2);
    }
  }
  cout << dp[1][m] << "\n";
  return 0;
}
