#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vi=vector<int>;
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
//上
const ll MOD = 1e9+7;
ll binpow(ll a,ll b){
    ll mul = a;
    ll ans = 1;
    while(b){
        if(b&1){
            ans = mul*ans%MOD;
        }
        b/=2;
        mul = mul*mul%MOD;
    }
    return ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    vector<vector<ll>> C(2001);
    C[0].push_back(1);
    for(int i = 1; i <=2000;i++){
        C[i].push_back(1);
        for(int j = 1; j <i;j++) C[i].push_back((C[i-1][j-1]+C[i-1][j])%MOD);
        C[i].push_back(1);
    }
    int n,k;
    cin >> n >> k;
    vector<int> v(n);
    FOR(i,0,n) cin >> v[i];
    sort(v.begin(),v.end());
    ll ans = 0;
    for(int i = 0; i < k; i++) ans-=v[i];
    for(int i = n-1; i> n-1-k;i--) ans += v[i];
    ll r = 0;
    if(v[k-1] == v[n-k]){

            int a = 0,b=0,c = 0,d= 0;
            for(int i = 0; i < k; i++) if(v[i] == v[k-1]) a++;
            for(int i = 0; i < n; i++) if(v[i] == v[k-1]) b++;
            for(int i = n-k; i < n; i++) if(v[i] == v[n-k]) c++;
            r = C[b][a+c]*C[a+c][c]%MOD;
            if(v[0] == v[n-1]) r = r*binpow(2,MOD-2)%MOD;
            cout <<ans<<" "<<r<<'\n';
        
    }else{
        int a = 0,b=0,c = 0,d= 0;
        for(int i = 0; i < k; i++) if(v[i] == v[k-1]) a++;
        for(int i = 0; i < n; i++) if(v[i] == v[k-1]) b++;
        for(int i = 0; i < n; i++) if(v[i] == v[n-k]) d++;
        for(int i = n-k; i < n; i++) if(v[i] == v[n-1]) c++;
        r = C[b][a]*C[d][c]%MOD;
        cout <<ans <<" "<<r<<'\n';
    }
}