Fill each cell with a positive integer such that integers do not repeat within any row, column, or outlined region. Within each region, one cell must be equal to the product of the other cells, and these “product” cells may not share edges with “product” cells from other regions. (See the example.)
The answer to this month’s puzzle is the smallest possible sum for the “product” cells.
Please send in your answer, as well as your grid.
(E.g., the first row of the filled-out Example would read “3,6,4,2”.)