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.
[[-95, -174, 90, -191, -33], [-76, -197, 89, 95, -153, -100], [-56, 26, -168, 71], [31, -175, -121], [30, -135, -112], [-5, -135, -81, -182, -169, 57], [-51, -20, -144, -179, 15, -117, 82], [-43, 21], [61, -108, -66, -3, -50]]