#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

const int N = 2000;
const int MOD = 1e9 + 7;

int C[N + 5][N + 5];

void init() {
  C[0][0] = 1;
  for (int i = 1; i <= N; ++i) {
    C[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
      if (C[i][j] >= MOD)
        C[i][j] -= MOD;
    }
  }
}

void solve() {
  int n, k;
  cin >> n >> k;

  init();

  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }

  sort(a.begin(), a.end());

  int x = a[k - 1];
  int l1 = k - 1;
  int s1 = 0, s2 = 0;
  for (int i = 0; i < k; ++i) {
    s1 += a[i];
    s2 += a[n - i - 1];
  }

  cout << s2 - s1 << " ";
  for (int i = k; i < n; ++i) {
    if (x == a[i]) {
      l1 = i;
    } else {
      break;
    }
  }

  int y = a[n - k], l2 = n - k;
  for (int i = n - k; i >= 0; --i) {
    if (y == a[i]) {
      l2 = i;
    } else {
      break;
    }
  }

  int nr1 = k, f1 = 0;
  int nr2 = k, f2 = 0;
  for (int i = 0; i < n; ++i) {
    if (x > a[i]) {
      --nr1;
    }
    if (x == a[i])
      ++f1;

    if (y < a[i]) {
      --nr2;
    }
    if (y == a[i])
      ++f2;
  }

  int ans = 1;
  if (x == y) {
    ans = 1LL * ans * C[f1][nr1] * C[f2 - nr1][nr2] % MOD;
    if (a[0] == a[n - 1]) {
      ans = C[f1][nr1] * C[f2 - nr1][nr2] / 2 % MOD;
    }
  } else {
    ans = 1LL * ans * C[f1][nr1] * C[f2][nr2] % MOD;
  }

  cout << ans << "\n";
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
//  cin >> t;
  while (t--)
    solve();

  return 0;
}