#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
    int arr1[] = {6,7,3,2};
    int arr2[] = {2,3};
    int n1 = sizeof(arr1)/sizeof(*arr1), n2 = sizeof(arr2)/sizeof(*arr2);
 
    unordered_set<int> st;
    for(int i=0;i<n1;++i){
        st.insert(arr1[i]);
    }
 
    for(int i=0;i<n2;++i){
        if(st.count(arr2[i]) == 0){
            cout << "Arr2 is not a subset of Arr1" << endl;
            return 0;
        }
    }
    cout << "Arr2 is a subset of Arr1" << endl;
    return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBpbnQgYXJyMVtdID0gezYsNywzLDJ9OwogICAgaW50IGFycjJbXSA9IHsyLDN9OwogICAgaW50IG4xID0gc2l6ZW9mKGFycjEpL3NpemVvZigqYXJyMSksIG4yID0gc2l6ZW9mKGFycjIpL3NpemVvZigqYXJyMik7CgogICAgdW5vcmRlcmVkX3NldDxpbnQ+IHN0OwogICAgZm9yKGludCBpPTA7aTxuMTsrK2kpewogICAgICAgIHN0Lmluc2VydChhcnIxW2ldKTsKICAgIH0KICAgIAogICAgZm9yKGludCBpPTA7aTxuMjsrK2kpewogICAgICAgIGlmKHN0LmNvdW50KGFycjJbaV0pID09IDApewogICAgICAgICAgICBjb3V0IDw8ICJBcnIyIGlzIG5vdCBhIHN1YnNldCBvZiBBcnIxIiA8PCBlbmRsOwogICAgICAgICAgICByZXR1cm4gMDsKICAgICAgICB9CiAgICB9CiAgICBjb3V0IDw8ICJBcnIyIGlzIGEgc3Vic2V0IG9mIEFycjEiIDw8IGVuZGw7CiAgICByZXR1cm4gMDsKfQ==