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.
[[50, 36, -82, -9], [-81, -41, -69, -133, -137, -120], [-154, -109, -86, 26, -163, -109], [16, 1, 19, -65, -176], [18, -172, -17, -156], [-184, -195, -52, -172], [-32, -50, 55, 46], [86, -83, -4, 61, -122, -2, -16]]