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.
[[-55, 30, 57, -185], [-5, -160, 25, -33, -165, 91], [21, 88, 61, -35], [-132, -31], [-199, -188], [-71, 18, 36, 93, -31, -41, -48], [-62, -53, 37, -72], [-189, -74], [-106, -96, -24, -11, -90, 7]]