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.
[[46, -11, 72, -46], [-104, -15, 17, 39], [-80, -137], [-129, 44, 56, 10], [-122, 36, -36, -52], [16, -35, 6, -130], [-144, -91, -8, 52]]