Moore's Nim with Two-Pile Moves

In Moore's Nim_k a player may, on a single turn, remove any positive number of stones from AT MOST k distinct piles (different counts allowed). Play Nim_2 (k=2) with four piles of sizes 1, 2, 4, 7 and last-stone-overall wins. Under optimal play, does the first player win or lose?