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.
[[-26, -154], [-119, -123, 44, 5], [6, -56], [52, -155, 16, -70, 18, -44], [-119, -174, -170, -65, -163], [-142, -11, -87, -158, 15], [-53, -79, -100, 27, 23], [100, 57, 6, -56, -129, -20, -86], [-177, 43, -138, -30, 42, 47]]