Is there a name (and strategy) for this nim variant?

There are $n$ lists of objects, say $L_1,\ldots,L_n$ where $L_i = \{a_{i,1},a_{i,2},\ldots,a_{i,n_i}\}$. Players take turns choosing a list and any number of *sequential* elements to remove. If they do not remove from one of the endpoints of the list, the list becomes effectively partitioned into two lists.

Of course, there is a "regular" version of the game where the last player to remove an element wins, and the "misere" version where the last player to remove an element loses.