In the standard 3-partition problem, there are $3 m$ integers, their sum is $m T$, and they have to be partitioned into $m$ subsets of sum $T$ and size $3$. Consider the variant without the restriction that the size is $3$ (but with the restriction that there are $m$ subsets with a sum of $T$). A...