a sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection c of all of them, and |c| is smaller than each of the sets. there has been a lot of recent progress on determining the maximum size of a sunflower-free family of subsets of [n]. we consider the problems of determining the maximum sum and product of k families of subsets of [n] that contain no sunflower of size k with one set from each family. we solve the sum problem exactly and make partial progress towards the product problem. \noindent{joint work with lujia wang.}