#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<algorithm>

#include<cmath>

#include<string>

#include<cstring>

#include<queue>

using namespace std;

typedef long long ll;

inline int read()

{

    int ans=;

    char last=' ',ch=getchar();

    while(ch<''||ch>'') last=ch,ch=getchar();

    while(ch>=''&&ch<='') ans=ans*+ch-'',ch=getchar();

    if(last=='-') ans=-ans;

    return ans;

}

int n,m,t;

int w[],v[];

int f[][];

int ans=;

int main()

{

    n=read();m=read();t=read();

    for(int i=;i<=n;i++) w[i]=read(),v[i]=read();

    for(int k=;k<=n;k++)

      for(int i=m;i>=w[k];i--)

         for(int j=t;j>=v[k];j--)

         f[i][j]=max(f[i][j],f[i-w[k]][j-v[k]]+),

         ans=max(ans,f[i][j]);

    printf("%d\n",ans);

    return ;

}