An even harder problem than $t>2$ and $n=m$ is the Prouhet–Tarry–Escott problem. Now I leave it to you and google to find lots of examples ;-)
Kevin Buzzard
- 41.4k
- 13
- 166
- 245