#include <bits/stdc++.h>
using namespace std;
 
int main() {
	// your code goes here
	int a[5]={2,4,7,1,5};
	int b[3]={5,4,2};
	unordered_map<int,int>m;
	for(int i=0;i<5;i++){
		m[a[i]]++;
	}
	for(int i=0;i<3;i++){
		if(m[b[i]]==0){
		    cout<<"there does not exit subarray";
		    return 0;
	     }
	     m[b[i]]--; //decrease count by 1 as we have matched it with current arr2[i]
 
	}
	cout<<"there exit the subarray"<<endl;
 
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgYVs1XT17Miw0LDcsMSw1fTsKCWludCBiWzNdPXs1LDQsMn07Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+bTsKCWZvcihpbnQgaT0wO2k8NTtpKyspewoJCW1bYVtpXV0rKzsKCX0KCWZvcihpbnQgaT0wO2k8MztpKyspewoJCWlmKG1bYltpXV09PTApewoJCSAgICBjb3V0PDwidGhlcmUgZG9lcyBub3QgZXhpdCBzdWJhcnJheSI7CgkJICAgIHJldHVybiAwOwoJICAgICB9CgkgICAgIG1bYltpXV0tLTsgLy9kZWNyZWFzZSBjb3VudCBieSAxIGFzIHdlIGhhdmUgbWF0Y2hlZCBpdCB3aXRoIGN1cnJlbnQgYXJyMltpXQogCgl9Cgljb3V0PDwidGhlcmUgZXhpdCB0aGUgc3ViYXJyYXkiPDxlbmRsOwogCglyZXR1cm4gMDsKfQ==