#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int ans;
int cnt[1010];
int main() {
  int i, j;
  int x, y;
  while (scanf("%d %d %d", &n, &m, &k) != EOF) {
    fill(cnt, cnt + n + 1, 10000000);
    for (i = 0; i < n; i++) {
      scanf("%d %d", &x, &y);
      if (cnt[x] > y) cnt[x] = y;
    }
    ans = 0;
    for (i = 1; i <= n; i++) {
      if (cnt[i] < 10000000) ans += cnt[i];
    }
    if (ans > k) ans = k;
    printf("%d\n", ans);
  }
}
