#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
const double PI  = 3.1415926535897932384626433832795028841971;
const int    INF = 1000000007;
const double EPS = 1e-10;
const int    MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

int n, d;
int p[1000];

int main(){
    int cnt = 0;
    cin >> n >> d;
    rep(i,n) cin >> p[i];
    rep(i,n){
        if(p[i] > d){
            cnt += p[i]-d;
        }
    }
    if(cnt <= 0) cout << "kusoge" << endl;
    else cout << cnt << endl;
}