#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 500;
int c, n, a[N], v[N], f[N];
bool ok(int x) {
  int nw = c, i = f[c + 1], fl = 0;
  for (; i > 0 && nw > 0; i = f[min(i, nw + 1)]) {
    if (i < x && fl == 0 && v[x] == 0) {
      nw -= min(nw / x, 1) * x;
      fl = 1;
      if (nw == 0) return 0;
    }
    nw -= min(nw / i, v[i] + (i == x)) * i;
  }
  if (nw > 0 && fl == 0 && v[x] == 0) nw -= min(nw / x, 1) * x;
  return nw > 0;
}
int main() {
  scanf("%d%d", &c, &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i), v[a[i]]++;
  for (int i = 1; i <= c + 1; i++)
    if (v[i - 1])
      f[i] = i - 1;
    else
      f[i] = f[i - 1];
  for (int i = 1; i <= c; i++)
    if (ok(i)) return printf("%d\n", i), 0;
  puts("Greed is good");
  return 0;
}
