#include <bits/stdc++.h>
using namespace std;
int main() {
  int kq = 0, n, m, k;
  int A[1001];
  for (int i = (1), _b = (1001); i <= _b; i++) A[i] = 1000000000;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = (1), _b = (n); i <= _b; i++) {
    int r, c;
    scanf("%d%d", &r, &c);
    A[r] = min(A[r], c);
  }
  for (int i = (1), _b = (m); i <= _b; i++) kq += A[i];
  printf("%d ", (kq > k ? k : kq));
}
