#include <bits/stdc++.h>
int sum[1005];
int main() {
  int n, m, k, max = 0, a, b;
  memset(sum, -1, sizeof(sum));
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &a, &b);
    if (sum[a] == -1 || b == 0) sum[a] = b;
    if (sum[a] != -1 && sum[a] >= b) sum[a] = b;
  }
  for (int i = 1; i <= m; i++) max += sum[i];
  if (max <= k)
    printf("%d\n", max);
  else
    printf("%d\n", k);
  return 0;
}
