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.
[[11, 97, 14, -2, -79, -175], [-6, -22], [50, -9, -63], [31, -15, 1], [-129, -41, -122, -87, -97, 12], [20, -114, 61, -122, 20, -38], [-67, -26, -3, -84]]