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.
[[40, 47, -2, -157, -8], [-190, -1, -20, -135], [20, 29, 96, 80, -131], [55, -158, -165, 51, -139, -143, -98], [-25, 90, -142, 78, -138, -130], [-138, -172, -91, -39, -28, -152], [-74, 25], [-22, -118, -122]]