#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
//#include "nachia/vec.hpp"
using namespace std;

void testcase(){
    i64 N, M, Q; cin >> N >> M >> Q;
    vector<i64> A(1<<N);
    vector<i64> B(1<<N);
    rep(i,N){
        i64 a,b; cin >> a >> b;
        rep(j,1<<i) A[j|(1<<i)] = A[j] + a;
        rep(j,1<<i) B[j|(1<<i)] = B[j] + b;
    }
    vector<i64> F(1<<N);
    rep(i,1<<N) if(A[i] <= Q) F[i] = B[i];
    rep(d,N) rep(i,1<<N) chmax(F[i|(1<<d)], F[i]);
    i64 ans = 0;
    rep(i,1<<N) if(A[i] <= M) chmax(ans, F[(1<<N)-1-i] + B[i]);
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}