#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=0;
    char last=‘ ‘,ch=getchar();
    while(ch<‘0‘||ch>‘9‘) last=ch,ch=getchar();
    while(ch>=‘0‘&&ch<=‘9‘) ans=ans*10+ch-‘0‘,ch=getchar();
    if(last==‘-‘) ans=-ans;
    return ans;
}

int n,m,t;
int w[105],v[105];
int f[205][205];
int ans=0;

int main()
{
    n=read();m=read();t=read();
    for(int i=1;i<=n;i++) w[i]=read(),v[i]=read();
    for(int k=1;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]]+1),
         ans=max(ans,f[i][j]);
    printf("%d\n",ans);
    return 0;
}