#include <bits/stdc++.h>
using namespace std;
const int HX = 0x3F3F3F3F;
int n, m, p, q;
long long k;
int f[1111];
int main() {
  cin >> n >> m >> k;
  memset(f, 0x3F, sizeof f);
  for (int i = 0; i < (n); ++i) {
    cin >> p >> q;
    f[p] = min(f[p], q);
  }
  long long ans = 0;
  for (int i = (1); i <= (m); ++i) ans += f[i];
  cout << min(ans, k) << endl;
  return 0;
}
