#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
const int INF = 1 << 30;
int ts[MAX_N];
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  fill(ts, ts + m, INF);
  for (int i = 0; i < n; i++) {
    int r, c;
    scanf("%d%d", &r, &c);
    r--;
    if (ts[r] > c) ts[r] = c;
  }
  int sum = 0;
  for (int i = 0; i < m; i++) sum += ts[i];
  printf("%d\n", min(sum, k));
  return 0;
}
