#include <bits/stdc++.h>
using namespace std;
const int maxn = 213245;
int a[maxn], w[maxn][2];
int dp[2002], sum[2002];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  memset(sum, 0, sizeof(sum));
  for (int i = 1; i <= k; ++i) {
    sum[i] = sum[i - 1] + a[i];
  }
  w[0][0] = 1;
  w[0][1] = 0;
  for (int i = 1; i <= m; ++i) {
    cin >> w[i][0] >> w[i][1];
  }
  for (int i = 0; i <= k; ++i) dp[i] = INT_MAX;
  dp[0] = 0;
  for (int i = 0; i < k; ++i) {
    for (int j = 0; j <= m; ++j) {
      int r = i + w[j][0], l = i + w[j][1];
      if (r <= k) dp[r] = min(dp[i] + sum[r] - sum[l], dp[r]);
    }
  }
  cout << dp[k] << '\n';
  return 0;
}
