#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i = 0; i<n; i++)


using namespace std;

int main(){
    
    int n,d; cin >> n >> d;
    int r = 0;
    vector<int>v(1010,0);
    rep(i,n)
	cin>>v[i];
    sort(v.begin(),v.end(),greater<int>());
    if(v[0] <= d)
    {
	cout << "kusoge" << endl;
	return 0;
    }
    for(int j = 0;j <v.size();j++)
    {
	if (v[j]- d >0 )
	  r += v[j] - d;
	else 
		break;

    }
    cout << r << endl;
}