#include <bits/stdc++.h>
using namespace std;
int const N = 1111;
int n, m, k, a[N];
int main() {
  memset(a, 1, sizeof(a));
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    int aa, bb;
    cin >> aa >> bb;
    a[aa - 1] = min(a[aa - 1], bb);
  }
  int res = 0;
  for (int i = 0; i < m; i++) {
    assert(a[i] < a[N - 1]);
    res += a[i];
  }
  res = min(res, k);
  cout << res << "\n";
  return 0;
}
