#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <stdint.h>
#include <libgen.h>

#include <unordered_set>
#include <unordered_map>

typedef unsigned uint;
typedef unsigned short ushort;
typedef unsigned char uchar;
typedef uint32_t u32;
typedef uint64_t u64;

#define nelem(a)  (sizeof(a) / sizeof((a)[0]))
#define nil	NULL

char *argv0;
#define USED(x) ((void)x)
#define SET(x) ((x)=0)

#define	ARGBEGIN	for((argv0||(argv0=*argv)),argv++,argc--;\
			    argv[0] && argv[0][0]=='-' && argv[0][1];\
			    argc--, argv++) {\
				char *_args, *_argt;\
				char _argc;\
				_args = &argv[0][1];\
				if(_args[0]=='-' && _args[1]==0){\
					argc--; argv++; break;\
				}\
				_argc = 0;\
				while(*_args && (_argc = *_args++))\
				switch(_argc)
#define	ARGEND		SET(_argt);USED(_argt);USED(_argc);USED(_args);}USED(argv);USED(argc);
#define	ARGF()		(_argt=_args, _args=(char*)"",\
				(*_argt? _argt: argv[1]? (argc--, *++argv): 0))
#define	EARGF(x)	(_argt=_args, _args=(char*)"",\
				(*_argt? _argt: argv[1]? (argc--, *++argv): ((x), abort(), (char*)0)))

#define	ARGC()		_argc




u32 keyTable[] = { 0,
	0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F,
	0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E,
	0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
	0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D,
	0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0,
	0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63,
	0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172,
	0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA,
	0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75,
	0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180,
	0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
	0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87,
	0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106,
	0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5,
	0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818,
	0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4,
	0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B,
	0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA,
	0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
	0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541,
	0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC,
	0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F,
	0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086,
	0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E,
	0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81,
	0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C,
	0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
	0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B,
	0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2,
	0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671,
	0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC,
	0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8,
	0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767,
	0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6,
	0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
	0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795,
	0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28,
	0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B,
	0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A,
	0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82,
	0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D,
	0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8,
	0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
	0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF,
	0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE,
	0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D,
	0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0,
	0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C,
	0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693,
	0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02,
	0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
};

#define CRC32(hash, c) (u32)(((hash) >> 8) ^ keyTable[(uchar)((c) ^ (hash))])

u32
GetKey(const char *str, int len)
{
	u32 hash;
	int i;
	hash = 0xFFFFFFFF;
	for(i = 0; i < len; i++)
		hash = (hash >> 8) ^ keyTable[(uchar)(*str++ ^ hash)];
	return hash;
}

u32
AppendKey(u32 hash, const char *str, int len)
{
	int i;
	for(i = 0; i < len; i++)
		hash = (hash >> 8) ^ keyTable[(uchar)(*str++ ^ hash)];
	return hash;
}

u32
GetUppercaseKey(const char *str, int len)
{
	u32 hash;
	int i;
	hash = 0xFFFFFFFF;
	for(i = 0; i < len; i++){
		char c = toupper(*str);
		str++;
		hash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
	}
	return hash;
}

u32
GetUppercaseKey(const char *str)
{
	u32 hash;
	int i;
	int len;
	hash = 0xFFFFFFFF;
	len = strlen(str);
	for(i = 0; i < len; i++){
		char c = toupper(*str);
		str++;
		hash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
	}
	return hash;
}


typedef struct HashPair HashPair;
struct HashPair
{
	u32 bigbuilding;
	u32 normal;
};

HashPair missingnames[] = {
#include "missingnames.inc"
};

typedef std::unordered_set<u32> Keyset;
typedef std::unordered_map<u32,u32> Keymap;


void
strtoupper(char *dst, const char *src)
{
	for(; *src; src++)
		*dst++ = toupper(*src);
	*dst = '\0';
}

int minlength = 0;
int maxlength = 9999;
char hashstr[128];
const char *hashprefix, *hashsuffix, *hashmiddle;
int suffixlen, middlelen;
u32 target;
Keyset *searchset;
Keyset::iterator notfound;

void
cracklist_r(u32 hash, char *s, int len)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		if(searchset->find(hash) != notfound){
			*s = '\0';
			printf("%s%s %X\n", hashprefix, hashstr, hash);
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		*s = c;
		newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
		cracklist_r(newhash, s+1, len-1);
	}
}
void
cracklist(const char *prefix, Keyset &set)
{
	int i;
	hashprefix = prefix;
	hashsuffix = "";
	searchset = &set;
	notfound = searchset->end();
	for(i = minlength; i < maxlength; i++)
		cracklist_r(GetUppercaseKey(prefix), hashstr, i);
}

void
cracklist_suffix_r(u32 hash, char *s, int len)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		hash = AppendKey(hash, hashsuffix, suffixlen);
		if(searchset->find(hash) != notfound){
			*s = '\0';
			printf("%s%s%s %X\n", hashprefix, hashstr, hashsuffix, hash);
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		*s = c;
		newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
		cracklist_suffix_r(newhash, s+1, len-1);
	}
}
void
cracklist_suffix(const char *prefix, const char *suffix, Keyset &set)
{
	char tmp[50];
	int i;

	hashprefix = prefix;
	strtoupper(tmp, suffix);
	hashsuffix = tmp;
	suffixlen = strlen(hashsuffix);
	searchset = &set;
	notfound = searchset->end();
	for(i = minlength; i < maxlength; i++)
		cracklist_suffix_r(GetUppercaseKey(prefix), hashstr, i);
}

void
cracklist_middle_r(u32 hash, char *s, int len, int nsub)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_$";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		if(nsub && searchset->find(hash) != notfound){
			*s = '\0';
			printf("%s%s %X\n", hashprefix, hashstr, hash);
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		// substitute by middle string
		if(c == '$'){
			// don't try more than once
			if(nsub)
				return;
			memcpy(s, hashmiddle, middlelen+1);
			newhash = AppendKey(hash, hashmiddle, middlelen);
			cracklist_middle_r(newhash, s+middlelen, len-1, nsub+1);
		}else{
			*s = c;
			newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
			cracklist_middle_r(newhash, s+1, len-1, nsub);
		}
	}
}
void
cracklist_middle(const char *prefix, const char *middle, Keyset &set)
{
	char tmp[50];
	int i;

	hashprefix = prefix;
	strtoupper(tmp, middle);
	hashmiddle = tmp;
	middlelen = strlen(hashmiddle);
	searchset = &set;
	notfound = searchset->end();
	for(i = minlength; i < maxlength; i++)
		cracklist_middle_r(GetUppercaseKey(prefix), hashstr, i, 0);
}

void
cracklist_middle_suffix_r(u32 hash, char *s, int len, int nsub)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_$";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		if(nsub){
			hash = AppendKey(hash, hashsuffix, suffixlen);
			if(searchset->find(hash) != notfound){
				*s = '\0';
				printf("%s%s%s %X\n", hashprefix, hashstr, hashsuffix, hash);
			}
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		// substitute by middle string
		if(c == '$'){
			// don't try more than once, or at the end
			if(nsub || len == 1)
				return;
			memcpy(s, hashmiddle, middlelen+1);
			newhash = AppendKey(hash, hashmiddle, middlelen);
			cracklist_middle_suffix_r(newhash, s+middlelen, len-1, nsub+1);
		}else{
			*s = c;
			newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
			cracklist_middle_suffix_r(newhash, s+1, len-1, nsub);
		}
	}
}
void
cracklist_middle_suffix(const char *prefix, const char *middle, const char *suffix, Keyset &set)
{
	char tmp[50];
	char tmp2[50];
	int i;

	hashprefix = prefix;
	strtoupper(tmp, middle);
	hashmiddle = tmp;
	middlelen = strlen(hashmiddle);
	strtoupper(tmp2, suffix);
	hashsuffix = tmp2;
	suffixlen = strlen(hashsuffix);
	searchset = &set;
	notfound = searchset->end();
	for(i = minlength; i < maxlength; i++)
		cracklist_middle_suffix_r(GetUppercaseKey(prefix), hashstr, i, 0);
}


void
crack_r(u32 hash, char *s, int len)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		if(hash == target){
			*s = '\0';
			printf("%s%s %X\n", hashprefix, hashstr, hash);
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		*s = c;
		newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
		crack_r(newhash, s+1, len-1);
	}
}
void
crack(const char *prefix, u32 t)
{
	int i;
	hashprefix = prefix;
	hashsuffix = "";
	target = t;
	for(i = minlength; i < maxlength; i++)
		crack_r(GetUppercaseKey(prefix), hashstr, i);
}

void
crack_suffix_r(u32 hash, char *s, int len)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		hash = AppendKey(hash, hashsuffix, suffixlen);
		if(hash == target){
			*s = '\0';
			printf("%s%s%s %X\n", hashprefix, hashstr, hashsuffix, hash);
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		*s = c;
		newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
		crack_suffix_r(newhash, s+1, len-1);
	}
}
void
crack_suffix(const char *prefix, const char *suffix, u32 t)
{
	char tmp[50];
	int i;

	hashprefix = prefix;
	strtoupper(tmp, suffix);
	hashsuffix = tmp;
	suffixlen = strlen(hashsuffix);
	target = t;
	for(i = minlength; i < maxlength; i++)
		crack_suffix_r(GetUppercaseKey(prefix), hashstr, i);
}

void
crack_middle_r(u32 hash, char *s, int len, int nsub)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_$";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		if(nsub && hash == target){
			*s = '\0';
			printf("%s%s %X\n", hashprefix, hashstr, hash);
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		// substitute by middle string
		if(c == '$'){
			// don't try more than once
			if(nsub)
				return;
			memcpy(s, hashmiddle, middlelen+1);
			newhash = AppendKey(hash, hashmiddle, middlelen);
			crack_middle_r(newhash, s+middlelen, len-1, nsub+1);
		}else{
			*s = c;
			newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
			crack_middle_r(newhash, s+1, len-1, nsub);
		}
	}
}
void
crack_middle(const char *prefix, const char *middle, u32 t)
{
	char tmp[50];
	int i;

	hashprefix = prefix;
	strtoupper(tmp, middle);
	hashmiddle = tmp;
	middlelen = strlen(hashmiddle);
	target = t;
	for(i = minlength; i < maxlength; i++)
		crack_middle_r(GetUppercaseKey(prefix), hashstr, i, 0);
}

void
crack_middle_suffix_r(u32 hash, char *s, int len, int nsub)
{
	const char charset[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_$";
	const char *p;
	char c;
	u32 newhash;
	if(len == 0){
		if(nsub){
			hash = AppendKey(hash, hashsuffix, suffixlen);
			if(hash == target){
				*s = '\0';
				printf("%s%s%s %X\n", hashprefix, hashstr, hashsuffix, hash);
			}
		}
		return;
	}
	for(p = charset; *p; p++){
		c = *p;
		// substitute by middle string
		if(c == '$'){
			// don't try more than once, or at the end
			if(nsub || len == 1)
				return;
			memcpy(s, hashmiddle, middlelen+1);
			newhash = AppendKey(hash, hashmiddle, middlelen);
			crack_middle_suffix_r(newhash, s+middlelen, len-1, nsub+1);
		}else{
			*s = c;
			newhash = (hash >> 8) ^ keyTable[(uchar)(c ^ hash)];
			crack_middle_suffix_r(newhash, s+1, len-1, nsub);
		}
	}
}
void
crack_middle_suffix(const char *prefix, const char *middle, const char *suffix, u32 t)
{
	char tmp[50];
	char tmp2[50];
	int i;

	hashprefix = prefix;
	strtoupper(tmp, middle);
	hashmiddle = tmp;
	middlelen = strlen(hashmiddle);
	strtoupper(tmp2, suffix);
	hashsuffix = tmp2;
	suffixlen = strlen(hashsuffix);
	target = t;
	for(i = minlength; i < maxlength; i++)
		crack_middle_suffix_r(GetUppercaseKey(prefix), hashstr, i, 0);
}



void
findbasehashes(Keyset &set)
{
	const char sufchars[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
	const char *p;
	u32 hash;
	int n;

	const Keyset::iterator notfound = set.end();
	for(hash = 0; hash != 0xFFFFFFFF; hash++){
		n = 0;
		for(p = sufchars; *p; p++)
			if(set.find(CRC32(hash, *p)) != notfound)
				n++;
		if(n > 1)
			printf("%x %d\n", hash, n);
	}
}

/*
DR = Dan Roberts    lead city artist: Rockstar Leeds 
JM = James McHale    city artist: Rockstar Leeds 
ME = Mark Edwards    city artist: Rockstar Leeds 
NB = ?
PM = Paul McKee        city artist: Rockstar Leeds 

Neal Corbett        city artist: Rockstar Leeds
Gunnar Droege        city artist: Rockstar Leeds
*/

void
usage(void)
{
	fprintf(stderr, "%s: [-p prefix] [-m middle] [-s suffix] (LOD|HD|hash)\n", argv0);
	fprintf(stderr, "example: %s -p LOD -s neon LOD\n", argv0);
	fprintf(stderr, "         %s -s shbuildws16 0xf23144c\n", argv0);
	exit(1);
}

int
main(int argc, char *argv[])
{
	Keyset lodset, normalset, allset;
	Keymap normal2lod;

	setvbuf(stdout, 0, _IONBF, 0);

	for(int i = 0; i < nelem(missingnames); i++)
		if(missingnames[i].bigbuilding){
			lodset.emplace(missingnames[i].bigbuilding);
			allset.emplace(missingnames[i].bigbuilding);
		}
	for(int i = 0; i < nelem(missingnames); i++)
		if(missingnames[i].normal){
			normalset.emplace(missingnames[i].normal);
			allset.emplace(missingnames[i].normal);
		}
	for(int i = 0; i < nelem(missingnames); i++)
		if(missingnames[i].normal && missingnames[i].bigbuilding)
			normal2lod.insert({missingnames[i].normal, missingnames[i].bigbuilding});

	const char *prefix = "";
	const char *middle = "";
	const char *suffix = "";
	Keyset *set = nil;
	u32 hash = 0;

	argv[0] = basename(argv[0]);
	ARGBEGIN{
	case 'p':
		prefix = EARGF(usage());
		break;
	case 'm':
		middle = EARGF(usage());
		break;
	case 's':
		suffix = EARGF(usage());
		break;
	case 'l':
		minlength = atoi(EARGF(usage()));
		break;
	}ARGEND
	if(argc < 1)
		usage();
	if(strcmpi(argv[0], "lod") == 0)
		set = &lodset;
	else if(strcmpi(argv[0], "hd") == 0)
		set = &normalset;
	else{
		char *end;
		hash = strtoll(argv[0], &end, 16);
		if(*argv[0] == '\0' || *end != '\0')
			usage();
	}

	if(prefix)
		minlength -= strlen(prefix);
	if(suffix)
		minlength -= strlen(suffix);
	if(minlength < 0)
		minlength = 0;

	// TODO: remove suffix from hashes before search instead of appending it every time

	if(*middle && *suffix){
		if(set)
			cracklist_middle_suffix(prefix, middle, suffix, *set);
		else
			crack_middle_suffix(prefix, middle, suffix, hash);
	}else if(*middle){
		if(set)
			cracklist_middle(prefix, middle, *set);
		else
			crack_middle(prefix, middle, hash);
	}else if(*suffix){
		if(set)
			cracklist_suffix(prefix, suffix, *set);
		else
			crack_suffix(prefix, suffix, hash);
	}else{
		if(set)
			cracklist(prefix, *set);
		else
			crack(prefix, hash);
	}

//	crack("jm_", 0x6aac348e);	// starlite
//	cracklist("custom", normalset);
//	findbasehashes(normalset);

//	cracklist("me_billboard", normalset);
//	cracklist_middle("", "_billboard", normalset);
//	cracklist("LOD", lodset);
//	cracklist_middle("LOD", "rland", lodset);
//	cracklist("LODrlandnew", lodset);
//	cracklist_middle("", "havanahouse", normalset);
//	crack_middle("LOD", "hangar", 0x47c7f7a0);
//	cracklist("LODlojetty", lodset);
//	cracklist("lodeabed", lodset);
//	crack_middle("", "_hospital", 0x9a2356a1);

//	cracklist("wshbuildws", normalset);
//	crack_suffix("", "SHBUILDWS16", 0xf23144c);
//	cracklist_middle("", "stiltsville", normalset);
//	cracklist("washbuild", normalset);
//	cracklist("washunder", normalset);
//	cracklist("wshgarage", normalset);
//	cracklist_middle("", "washnewsky", normalset);
//	cracklist("LODashnewsky", lodset);

//	cracklist_middle("LOD", "neon", lodset);
//	cracklist_middle("LOD", "bridge", lodset);
//	cracklist_suffix("", "dks_neona", normalset);
//	cracklist("dr_dts_neon", normalset);
//	cracklist_suffix("LOD", "neona", lodset);
//	cracklist_suffix("", "HOT_NEONA", normalset);
//	cracklist_suffix("", "DT55_NEON", normalset);
//	cracklist("jm_dt", normalset);


//	cracklist_suffix("", "BIGHOTELA", normalset);
//	cracklist_middle("LOD", "hotel", lodset);
//	cracklist("LODnewhotel", lodset);
//	cracklist_suffix("", "otel082PW", normalset);


	return 0;
}