#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int rv[1000];
int main() {
  cin >> n >> m >> k;
  memset(rv, -1, sizeof(rv));
  for (int i = 0; i < n; ++i) {
    int r, c;
    cin >> r >> c;
    if (rv[r - 1] == -1 || rv[r - 1] > c) rv[r - 1] = c;
  }
  int ans = 0;
  for (int i = 0; i < m; ++i) {
    if (rv[i] == -1) continue;
    ans += rv[i];
    ans = min(k, ans);
  }
  cout << ans << endl;
  return 0;
}
