Simulate a Bloom Filter

A Bloom filter uses m bits and two hash functions h1(x) = x mod m and h2(x) = (7x + 3) mod m. Process insert x and query x operations. A query prints MAYBE if both bits are set and NO otherwise.

1 <= m <= 1000