main.py

import sys


def solve(data: str) -> str:
    tokens = data.split()
    if not tokens:
        return ""
    it = iter(tokens)
    food_cap = int(next(it))
    med_cap = int(next(it))
    n = int(next(it))
    feasible = 0
    best = None
    for _ in range(n):
        name = next(it)
        food = int(next(it))
        med = int(next(it))
        days = int(next(it))
        morale = int(next(it))
        if food > food_cap or med > med_cap:
            continue
        feasible += 1
        score = morale * 3 - days - food - med
        candidate = (-score, days, name, food_cap - food, med_cap - med, score, name)
        if best is None or candidate < best:
            best = candidate
    if best is None:
        return "\n".join(
            [
                "feasible=0",
                "best=NONE",
                f"reserve={food_cap} {med_cap}",
            ]
        )
    return "\n".join(
        [
            f"feasible={feasible}",
            f"best={best[6]} {best[5]}",
            f"reserve={best[3]} {best[4]}",
        ]
    )


if __name__ == "__main__":
    sys.stdout.write(solve(sys.stdin.read()).strip())
    sys.stdout.write("\n")