Nim Game Winner

The game of Nim is played with three heaps. Two players take turns removing one or more items from a single pile. The player forced to take the last stone loses. Given starting heap sizes [a, b, c] and assuming optimal play, determine whether the first player has a forced win. Output "true" or "false".