#include <bits/stdc++.h>
using namespace std;
int n, m, k, i, M[1000], a, b, s;
int main() {
  for (i = 0; i < 1000; ++i) M[i] = 1000001;
  scanf("%d %d %d", &n, &m, &k);
  for (i = 0; i < n; ++i) {
    scanf("%d %d", &a, &b);
    if (M[a - 1] > b) M[a - 1] = b;
  }
  for (i = 0; i < m; ++i) s += M[i];
  cout << min(k, s) << "\n";
}
