#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1), eps = 1e-9;
const int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
const int N = 3e5 + 5, mod = 1e9 + 7, inf = 1e9;
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> r(n), c(n), ans(m + 1, 1e9);
  for (int i = 0; i < n; i++) {
    cin >> r[i] >> c[i];
    ans[r[i]] = min(ans[r[i]], c[i]);
  }
  long long sum = 0;
  for (int i = 1; i <= m; ++i) {
    sum += ans[i];
  }
  cout << min(sum, (long long)k);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) solve();
}
