#include <bits/stdc++.h>
using namespace std;
void SelectSort(long long a[1001][2], long long n) {
  int k, t;
  for (int i = 1; i < n - 1; i++) {
    k = i;
    for (int j = i + 1; j < n; j++) {
      if (a[j] < a[k]) k = j;
    }
    if (a[i] != a[k]) {
      t = a[i][0];
      a[i][0] = a[k][0];
      a[k][0] = t;
      t = a[i][1];
      a[i][1] = a[k][1];
      a[k][1] = t;
    }
  }
}
int main() {
  long long n, m, k, a[1001][2], res = 0, min, x;
  while (cin >> n >> m >> k) {
    for (int i = 1; i < n + 1; i++) cin >> a[i][0] >> a[i][1];
    x = 1;
    while (x < m + 1) {
      min = 1000001;
      for (int i = 1; i < n + 1; i++) {
        if (a[i][0] == x) {
          if (a[i][1] < min) min = a[i][1];
        }
      }
      res += min;
      x++;
    }
    if (res > k)
      cout << k;
    else
      cout << res;
  }
}
