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.
[[-5, 99, 34, 6], [-106, 21], [12, -37, 1, 85], [-130, 38, -103, -199, -109], [-24, -93, 11, -166, -166, 42, -29], [-153, -155, -62, -172, 40, -200], [-47, -86, 25, -184], [-30, -40], [-94, -42, 42, -172, -14, -143, -31]]