#include <bits/stdc++.h>
using namespace std;
int s[1010];
int main() {
  int t, m, n, j, k, l, x, y;
  while (cin >> m >> n >> t) {
    memset(s, 0x3f, sizeof(int) * (n + 5));
    for (j = 0; j < m; j++) {
      cin >> x >> y;
      s[x] = min(s[x], y);
    }
    int ans = 0;
    for (j = 1; j <= n; j++) ans += s[j];
    cout << min(ans, t) << endl;
  }
  return 0;
}
