# https://yukicoder.me/problems/no/3696

from collections import deque


def main():
    S, T, N = map(int, input().split())
    pab = []
    for _ in range(3):
        p, a, b = map(int, input().split())
        pab.append((p,a,b))

    dp = [[0] * T for _ in range(N + 1)]
    for n in range(N):
        weight = 100 ** n
        for w in range(T):
            max_ans = -1
            for x in range(w + 1):
                ans = 0
                for p, a, b in pab:
                    y = w - x + ((x * a) // b)
                    if y >= T:
                        ans += (p * weight)
                    else:
                        ans += p * dp[N - n][y]
                max_ans = max(max_ans, ans)
            dp[N - 1 - n][w] = max_ans

    max_q = dp[0][S]
    ans1 = max_q // (100 ** (N - 1))
    print(ans1)

    weight = 100 ** (N - 1)
    w = S
    array = []
    max_ans = -1
    for x in range(w + 1):
        ans = 0
        for p, a, b in pab:
            y = w - x + ((x * a) // b)
            if y >= T:
                ans += (p * weight)
            else:
                ans += p * dp[1][y]
        if ans > max_ans:
            max_ans = ans
            array = [x]
        elif ans == max_ans:
            array.append(x)

    array.sort()

    print(len(array))
    print(" ".join(map(str, array)))


                        



        

    


if __name__ == "__main__":
    main()