#include <bits/stdc++.h>
using namespace std;
int arr[300009];
int brr[300009];
int freq[300009];
int main() {
  int c, n;
  cin >> c >> n;
  for (int i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
    ++freq[arr[i]];
  }
  sort(arr, arr + n, greater<int>());
  int idx = 0;
  for (int i = c; i > 0; i--) {
    while (arr[idx] > i) {
      ++idx;
    }
    brr[i] = arr[idx];
  }
  for (int i = 1; i <= c; i++) {
    ++freq[i];
    int p = c;
    int last = c + 1;
    int d = c;
    while (brr[d] != 0) {
      int q = brr[d];
      if (i <= d && i > q) {
        q = i;
      }
      int mn = min(freq[q], p / q);
      p -= q * mn;
      last = q;
      d = min(p, last - 1);
    }
    if (p != 0) {
      cout << i << endl;
      return 0;
    }
    --freq[i];
  }
  puts("Greed is good");
  return 0;
}
