UVA1412FundManagement

//UVA1412FundManagement
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int m, n, kk;
const int MAXN = 8 + 2, MAXM = 100 + 10;
const double INF = 1e29;
int name[MAXN][100], s[MAXN], k[MAXN]; 
double c, price[MAXN][MAXM];
const int maxstate = 15000;
vector<vector<int> > states;
map<vector<int>, int> ID;
double d[MAXM][maxstate];
void dfs(int stocks, vector<int>& lots, int totlot) {
    	
	if(stocks == n) {
		ID[lots] = states.size();
		states.push_back(lots);
	}
	else {
		for(int i = 0; i <= k[stocks] && i + totlot <= kk; i++) {
			lots[stocks] = i;
			dfs(stocks + 1, lots, totlot + i);
		}
	}
} 
int buy_next[maxstate][MAXM], sell_next[maxstate][MAXM];

void Initial() {
	ID.clear();
	states.clear();
	vector<int> lots(n);
	dfs(0, lots, 0);
	for(int i = 0; i < states.size(); i++) {
		int totlot = 0;
		for(int j = 0; j < n; j++) totlot += states[i][j];
		for(int j = 0; j < n; j++) {
			buy_next[i][j] = sell_next[i][j] = -1;
			if(states[i][j] < k[j] && totlot < kk) {
				vector<int> newstate = states[i];
				newstate[j]++;
				buy_next[i][j] = ID[newstate];
			}
			if(states[i][j] > 0) {
				vector<int> newstate = states[i];
				newstate[j]--;
				sell_next[i][j] = ID[newstate];
			}
		} 
	}
	
}
int opt[MAXM][maxstate], Pre[MAXM][maxstate];
void update(int day, int s, int s2, double v, int o) {
	if(v > d[day + 1][s2]) {
		d[day + 1][s2] = v;
		opt[day + 1][s2] = o;
		Pre[day + 1][s2] = s;
	}
}
double dp() {
	for(int i = 0; i <= m; i++) 
	    for(int j = 0; j <= states.size(); j++) d[i][j] = -INF;
	
	d[0][0] = c;
	for(int i = 0; i < m; i++) {
		for(int j = 0; j < states.size(); j++) {
			double v = d[i][j];
			if(v < -1) continue;//精度问题，如果是小于零，可能因为精度使答案出错 
			update(i, j, j, v, 0); //hold操作
			for(int k = 0; k < n; k++) {
				if(buy_next[j][k] >= 0 && v >= price[k][i] - 1e-3) {//buy操作 
					update(i, j, buy_next[j][k], v - price[k][i], k + 1);
				} 
				if(sell_next[j][k] >= 0) {//sell操作 
					update(i, j, sell_next[j][k], v + price[k][i], -k - 1);
				}
			} 
		}
	}
	return d[m][0];
}
void print(int day, int s) {
	if(day == 0) return ;
	print(day - 1, Pre[day][s]);
	if(opt[day][s] == 0) printf("HOLD\n");
	else if(opt[day][s] > 0) printf("BUY %s\n", name[opt[day][s] - 1]);
	else if(opt[day][s] < 0) printf("SELL %s\n", name[-opt[day][s] - 1]);
}
int main() {
	int kase = 0;
	
	while(scanf("%lf%d%d%d", &c, &m, &n, &kk) == 4) {
		if(kase++) printf("\n");
		for(int i = 0; i < n; i++) {
			scanf("%s%d%d", name[i], &s[i], &k[i]);
			for(int j = 0; j < m; j++) {
				double tmp;
				scanf("%lf", &tmp);
				price[i][j] = s[i] * tmp;
			}
		}
		Initial();
		printf("%.2lf\n", dp());
		print(m, 0);
    }
	return 0;
} 
/*
144624.00 9 5 3
IBM 500 3
97.27 98.31 97.42 98.9 100.07 98.89 98.65 99.34 100.82
GOOG 100 1
467.59 483.26 487.19 483.58 485.5 489.46 499.72 505 504.28
JAVA 1000 2
5.54 5.69 5.6 5.65 5.73 6 6.14 6.06 6.06
MSFT 250 1
29.86 29.81 29.64 29.93 29.96 29.66 30.7 31.21 31.16
ORCL 300 3
17.51 17.68 17.64 17.86 17.82 17.77 17.39 17.5 17.3
*/