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.
[[41, -117, -139, -153, -108, 50, -118], [95, 33, -71], [-138, -171, -186, -163, -60, -98, -82], [64, -63, -86, -89, -150, 26, -106], [-6, -102, 97, -36]]