#include <bits/stdc++.h>
using namespace std;
long long int minn(long long int a, long long int b) {
  if (a > b) return b;
  return a;
}
long long int maxx2(long long int a, long long int b) {
  if (a > b) return a;
  return b;
}
long long int maxx(long long int a, long long int b, long long int c) {
  return maxx2(a, maxx2(b, c));
}
long long int gcdd(long long int a, long long int b) {
  if (b == 0)
    return a;
  else
    return gcdd(b, a % b);
}
long long int dsum(long long int n) {
  long long int sum = 0;
  while (n > 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
long long int poww(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b == 1)
    return a;
  else
    return poww(a, b / 2) * poww(a, b / 2) * poww(a, b % 2);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  long long int a[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] > (n - k)) a[i] = 0;
  }
  long long int x = 0, y = 0;
  for (long long int i = 0; i < n; i++) {
    if (a[i] == 0) {
      x = i;
      break;
    }
  }
  for (long long int i = n - 1; i >= 0; i--) {
    if (a[i] == 0) {
      y = i;
      break;
    }
  }
  if (x == y) {
    cout << n << " " << 1 << endl;
    return 0;
  }
  long long int ans = 1, temp = 1;
  for (long long int i = x + 1; i < y + 1; i++) {
    if (a[i] == 0) {
      ans = ans * temp;
      ans = ans % 998244353;
      temp = 1;
    } else {
      temp++;
    }
  }
  long long int ans1 = 0;
  for (long long int i = n; i > n - k; i--) ans1 += i;
  cout << ans1 << " " << ans << endl;
  return 0;
}
