//#define int long long
#include "jelly.h"
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;
const int N=1e6,M=1e4;
int mem[203][600][600];
long long minn=1e18,mux=-1e18;
int n,x,y;
int a[N],b[N];
int dp(int i,int x,int y){
if(i==n)return 0;
if(mem[i][x][y]!=-1)return mem[i][x][y];
if(x>=a[i]&&y>=b[i])return mem[i][x][y]=max({dp(i+1,x-a[i],y)+1,dp(i+1,x,y-b[i])+1,dp(i+1,x,y)});
else if(x>=a[i]&&y<b[i])return mem[i][x][y]=max(dp(i+1,x-a[i],y)+1,dp(i+1,x,y));
else if(x<a[i]&&y>=b[i])return mem[i][x][y]=max(dp(i+1,x,y-b[i])+1,dp(i+1,x,y));
else return mem[i][x][y]=dp(i+1,x,y);
}
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
n = a.size();
for(int i=0;i<n+2;i++)
for(int j=0;j<x+2;j++)
for(int k=0;k<y+2;k++)
mem[i][j][k]=-1;
return dp(0,x,y);
}
