  In this paper, we consider a modular extension to the game of Nim, which we
call $m$-Modular Nim, and explore its optimal strategy. In $m$-Modular Nim, a
player can either make a standard Nim move or remove a multiple of $m$ tokens
in total. We develop a winning strategy for all $m$ with $2$ heaps and for odd
$m$ with any number of heaps.
