#include <bits/stdc++.h>
const int maxN = 1010;
using namespace std;
int M, N, K;
pair<int, int> V[maxN];
int sol, minim;
int main() {
  int i, j;
  scanf("%d%d%d", &M, &N, &K);
  for (i = 1; i <= M; i++) scanf("%d%d", &V[i].first, &V[i].second);
  sort(V + 1, V + M + 1);
  for (i = 1; i <= M; i++) {
    j = i;
    minim = 2000000000;
    while (V[j].first == V[i].first && j <= M) {
      minim = min(minim, V[j].second);
      j++;
    }
    j--;
    sol += minim;
    i = j;
  }
  if (sol > K) sol = K;
  printf("%d\n", sol);
  return 0;
}
