#include <iostream>
#include <map>
#include <list>
#include <algorithm>
using namespace std;

//#define contains(x,a) (x).find(a)!=(x).end()

template <class T, class U> 
bool contains (const T& x, U a) {
    return x.find(a)!=x.end();
}

template <class U>
bool contains (const list<U>& x, U a) {
    return std::find(x.begin(), x.end(), a)!=x.end();
}

int main() {
	map<int,int> m{{12,1},{11,2}}; 
	list<int> l{3,12,5}; 
	if (contains(m,12)) 
	    cout <<"yes!"<<endl; 
	if (contains(l,12)) 
	    cout <<"yes!"<<endl; 
	return 0;
}