static int runTestCase(int casenum__) {
		switch (casenum__) {
		case 0: {
			int[] l = { 2, 4, 3, 2, 2, 1, 10 };
			int[] t = { 2, 6, 3, 7, 0, 2, 0 };
			int expected__ = 6;

			return verifyCase(casenum__, expected__, new EelAndRabbit().getmax(l, t));
		}
		case 1: {
			int[] l = { 1, 1, 1 };
			int[] t = { 2, 0, 4 };
			int expected__ = 2;

			return verifyCase(casenum__, expected__, new EelAndRabbit().getmax(l, t));
		}
		case 2: {
			int[] l = { 1 };
			int[] t = { 1 };
			int expected__ = 1;

			return verifyCase(casenum__, expected__, new EelAndRabbit().getmax(l, t));
		}
		case 3: {
			int[] l = { 8, 2, 1, 10, 8, 6, 3, 1, 2, 5 };
			int[] t = { 17, 27, 26, 11, 1, 27, 23, 12, 11, 13 };
			int expected__ = 7;

			return verifyCase(casenum__, expected__, new EelAndRabbit().getmax(l, t));
		}

		// custom cases

		/*
		 * case 4: {
		 * int[] l = ;
		 * int[] t = ;
		 * int expected__ = ;
		 *
		 * return verifyCase(casenum__, expected__, new EelAndRabbit().getmax(l,
		 * t));
		 * }
		 */
		/*
		 * case 5: {
		 * int[] l = ;
		 * int[] t = ;
		 * int expected__ = ;
		 *
		 * return verifyCase(casenum__, expected__, new EelAndRabbit().getmax(l,
		 * t));
		 * }
		 */
		/*
		 * case 6: {
		 * int[] l = ;
		 * int[] t = ;
		 * int expected__ = ;
		 *
		 * return verifyCase(casenum__, expected__, new EelAndRabbit().getmax(l,
		 * t));
		 * }
		 */
		default:
			return -1;
		}
	}