GEM is computationally intensive
Regardless of the size of M (the number of coverages) there is an upper limit on the size of K which is quite small circa 2-5 depending on M, size, and speed of hardware
For example there are 3160 permutations of 2 maps from 80 compared with 24,040,016 if any 5 are used