Note that you need to use 3 shifts. All the triplets of shifts listed in the paper should generate sequences with period 2^32-1 or 2^64-1 depending on the state size, because the tables were generated with that constraint. For example the first triplet for a 32 bit state corresponds to the algortihm:

  def advance_state(state):
    state ^= state << 1
    state ^= state >> 3
    state ^= state << 10
    return state