#include "jelly.h"
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;
int ma,mb;
int maxi(int x, int y, std::vector<int> a, std::vector<int> b,int nodo,int r){
if((nodo==a.size() )|| (x<ma && y<mb) ||(r==a.size())){
return r;
}
else{
if(a[nodo]<=x && b[nodo]<=y){
return max(maxi(x-a[nodo],y,a,b,nodo+1,r+1),max(maxi(x,y-b[nodo],a,b,nodo+1,r+1),maxi(x,y,a,b,nodo+1,r)));
}
else if(a[nodo]<=x){
return max(maxi(x-a[nodo],y,a,b,nodo+1,r+1),maxi(x,y,a,b,nodo+1,r));
}
else if(b[nodo]<=y){
return max(maxi(x,y-b[nodo],a,b,nodo+1,r+1),maxi(x,y,a,b,nodo+1,r));
}
else{
return maxi(x,y,a,b,nodo+1,r);
}
}
}
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
int n = a.size();
ma=1e9;
mb=1e9;
for(int i=0;i<n;i++){
if(a[i]<ma)ma=a[i];
if(b[i]<mb)mb=b[i];
}
return maxi(x,y,a,b,0,0);
}
