#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;
const int N = 1010;
int r[N];
int n, m, k;

  int main()
{
	cin >> n >> m >> k;
	
	for(int i = 0; i < n; i ++ )//n个牙齿
	{
		int x, c;
		cin >> x >> c;
		if(r[x] == 0 || (r[x] && c < r[x])) r[x] = c;
	}
	
	int res = 0;
	for(int i = 1; i <= m; i ++ ) res += r[i];//把每排能量值的最小值累加
		
	cout << min(k, res);
	
	return 0;
}