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.
[[-21, -41, 100, 3, -56, -3], [-188, -125, -73, -28, -44, 83, -62], [55, 46], [74, 7], [33, -122, -59], [-60, -182, -164, 63, 72, -106, -188], [-114, -124, 6, -90, -189, -5, -5], [-171, -56], [6, -148, -54, -37]]