Hi all, I need help in solving this DP problem from Atcoder.
The editorial for this problem is not available in English and hence I can't even get a bit of it.
Some thoughts which came into my head after reading the problem :-
1) Oh, this is another counting problem and the constraints are too low, surely it's a DP problem.
2) The constraints on W <= 8, may be it has something to do with bitmasks ?

But, I can't figure out the state of DP and transition of DP states. It would be great help if anyone could give me some hints on how to approach this DP problem. Please explain the state and DP transition. I would love to implement the problem on my own.

A help would be appreciated. Thanks!