Algorithm for heavily restricted Knapsack problem

Question

I have a following problem to solve:

1. We have 53 weeks in a year, for each week we need to choose one model from the list: [A1, A2,....,F149, F1