#include <bits/stdc++.h>
using namespace std;
int val[1005];
int main() {
  int n, m, k, temp, i, ans, id;
  while (scanf("%d%d%d", &n, &m, &k) != EOF) {
    memset(val, 50, sizeof(val));
    for (i = 0; i < n; i++) {
      scanf("%d%d", &id, &temp);
      if (temp < val[id]) val[id] = temp;
    }
    ans = 0;
    for (i = 1; i <= m; i++) {
      ans += val[i];
    }
    printf("%d\n", ans < k ? ans : k);
  }
  return 0;
}
