  We describe all possible bimodal over-twist patterns. In particular, we give
an algorithm allowing one to determine what the left endpoint of the
over-rotation interval of a given bimodal map is. We then define a new class of
polymodal interval maps called well behaved, and generalize the above results
onto well behaved maps.
