#include <bits/stdc++.h>
using namespace std;

// ================== MACROS ==================
#define ll long long
#define ull unsigned long long
#define ld long double
#define endl '\n'

#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define ff first
#define ss second

// ================== CONSTANTS ==================
const ll INF = 1e18;
// const int MOD = 1e9 + 7; // leetcode
const int MOD = 998244353;  // atcoder, codeforces
const int N = 2e5 + 5;
string v = "aeiou";
string V = "AEIOU";

// ================== FAST IO ==================
void fast_io() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
}

// ================== DEBUG ==================
#ifndef ONLINE_JUDGE
#define debug(x)       \
  cerr << #x << " = "; \
  _print(x);           \
  cerr << endl;
#else
#define debug(x)
#endif

void _print(int x) { cerr << x; }
void _print(ll x) { cerr << x; }
void _print(string x) { cerr << x; }
void _print(char x) { cerr << x; }

template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}

// ================== MATH ==================
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll mod_add(ll a, ll b) { return (a % MOD + b % MOD) % MOD; }
ll mod_mul(ll a, ll b) { return (a % MOD * b % MOD) % MOD; }
ll mod_pow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = mod_mul(res, a);
    a = mod_mul(a, a);
    b >>= 1;
  }
  return res;
}

void solve() {
  long long y;
  int n;
  cin >> y >> n;

  long long sum = 0;
  for (int i = 0; i < n; i++) {
    long long x;
    cin >> x;
    sum += x;
  }

  if (sum > y) {
    cout << "red\n";
  } else {
    cout << (y - sum) << "\n";
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }

  return 0;
}