In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[-89, -31, -19, -33], [-24, -168, 91], [-16, -77], [-58, -124, 6], [-6, -134, 39, -167], [-163, -34, -4, 26, 66], [-88, -100, -197, -115], [-35, -154]]