#include <bits/stdc++.h>
using namespace std;
int row[1010];
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  memset(row, 0x3f3f3f3f, sizeof row);
  long long ans = 0;
  for (int i = (0); i < (n); ++i) {
    int r, c;
    scanf("%d %d", &r, &c);
    row[r] = min(c, row[r]);
  }
  for (int i = 1; i <= m; ++i) ans += ((row[i] == 0x3f3f3f3f) ? 0 : row[i]);
  printf("%lld\n", min(ans, (long long)k));
  return 0;
}
