#include <bits/stdc++.h>
using namespace std;
int cnt[200005], pre[200005];
int n, c;
int main() {
  scanf("%d%d", &c, &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    cnt[x]++;
  }
  for (int i = 1; i <= c; i++) {
    pre[i] = pre[i - 1];
    if (cnt[i]) pre[i] = i;
  }
  if (cnt[c]) {
    puts("Greed is good");
    return 0;
  }
  for (int i = 1; i <= c - 1; i++) {
    int tot = c, wz = pre[c];
    bool ok = 1;
    while (wz) {
      if (tot == 0) break;
      if (wz == i) {
        ok = 0;
        tot -= wz * (((cnt[wz] + 1) < (tot / wz)) ? cnt[wz] + 1 : tot / wz);
        wz = (((pre[wz - 1]) < (pre[tot])) ? pre[wz - 1] : pre[tot]);
      } else if (wz < i) {
        if (ok) {
          ok = 0;
          if (tot >= i) tot -= i;
        } else {
          tot -= wz * (((cnt[wz]) < (tot / wz)) ? cnt[wz] : tot / wz);
          wz = (((pre[wz - 1]) < (pre[tot])) ? pre[wz - 1] : pre[tot]);
        }
      } else {
        tot -= wz * (((cnt[wz]) < (tot / wz)) ? cnt[wz] : tot / wz);
        wz = (((pre[wz - 1]) < (pre[tot])) ? pre[wz - 1] : pre[tot]);
      }
    }
    if (tot) {
      printf("%d", i);
      return 0;
    }
  }
  puts("Greed is good");
  return 0;
}
