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.
[[99, 30, -98, -133, 76], [-91, 30, 8, -171], [-2, -92, 91, -175, -8, -7], [98, -7, -166, -41, 34, 16, -34], [-88, 80, -200], [-7, -95, -158, 2, -117, -14], [-103, -77, -137, 100], [-123, -143], [-110, -28, -102, -162, -97, -106, 50]]