permutationsParticions.cpp

//codeforces.com/contest/1326/problem/C

#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define fr(i, n) for(int i = 0; i < n; i++)
#define frr(i, n) for(int i = 1; i <= n; i++)

#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()
#define ms(x, i) memset(x, i, sizeof(x))

#define p(x) cout << x << "\n"
#define pv(x) fr(i, x.size()) cout << x[i] << " \n"[i==x.size()-1]

#define f first
#define s second

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f;

const ll mod = 998244353;

int main() {
    fastio;

    ll n, k;
    cin >> n >> k;

    ll p[n];
    fr(i, n) cin >> p[i];
    vector<bool> isn(n+1, 0);

    ll mx = 0ll;
    for (ll oi = n; oi > n-k; oi--) mx += oi, isn[oi] = 1;

    ll ans = 1; 

    int l = 0, r = n-1;
    while (!isn[p[l]]) l++;
    while (!isn[p[r]]) r--;
    l++;

    ll cnt = 0ll;
    while (l <= r) {

        if (isn[p[l]]) {
            cnt++;
            ans = (ans*cnt)%mod;
            cnt = 0ll;
            l++;
            continue;
        }
        cnt++;
        l++;
    }

    cout << mx << " " << ans << endl;
}