#include <bits/stdc++.h> using namespace std; int a[100],b[100],c[100],d[100]; int total; int n; int print() { if(total<=2) { for(int k=1;k<=n;k++) cout<<a[k]<<" "; cout<<endl; } total++; } void queen(int i) { if(i>n) { print(); return; } else { for(int j=1;j<=n;j++) { if((!b[j])&&(!c[i+j])&&(!d[i-j+n])) { a[i]=j; b[j]=1; c[i+j]=1; d[i-j+n]=1; queen(i+1); b[j]=0; c[i+j]=0; d[i-j+n]=0; } } } } int main() { cin>>n; queen(1); cout<<total; return 0;

}

#include <bits/stdc++.h> using namespace std; int n,arr[105][105],ldjx[205],rdjx[205],row[105]; int dfs(int x) { for(int i=1;i<=n;i++) { if(row[x]==0&&col[j]==0&&) } } int main() { cin>>n; dfs(1); return 0; }

using namespace std;
bool c(int k,int n,int m,int a[555555],int b[555555]){  
    long long mmd=0;  
    for(int i=0;i<n;++i){  
        long long fl=(long long)b[i]*k;  
        if(fl>a[i]){  
            mmd+=(fl-a[i]);  
            if(mmd>m) 
				return 0;  
        }  
    }  
    return mmd<=m;  
}  
int main() {  
    freopen("toy.in","r",stdin);  
    freopen("toy.out","w",stdout);
	int n,m;  
    cin>>n>>m;  
    int a[n],b[n];  
    for(int i=0;i<n;++i) 
		cin>>a[i];  
    for(int i=0;i<n;++i) 
		cin>>b[i];  
    int l=0,r=1e18,res=0;  
    while(l<=r){  
        int mid=l+(r-l)/2;  
        if(c(mid,n,m,a,b)){  
            res=mid;  
            l=mid+1;  
        } 
		else{  
            r=mid-1;  
        }  
    }  
    cout<<res;  
	
	return 0;
}