def is_subset(arr1, m, arr2, n):
	 
	hashset = set() 
	for i in range(0, m): 
		hashset.add(arr1[i]) 
	for i in range(0, n): 
		if arr2[i] in hashset: 
			continue
		else: 
			return False
	return True		
def is_subset(arr1, m, arr2, n):
    hashset = set()
    i = 0
    while i < m:
        hashset.add(arr1[i])
        i += 1
    for i in range(0, n):
       
        if arr2[i] in hashset:
            continue
        else:
            return False
    return True