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.
[[43, 25, -166, -52, -126], [25, -50, -129, -125], [88, -122, -70, -33, 49, 38, -108], [-160, -121, -166, -164, 66, 54, -140], [-78, 38, 17, -33, -191, 80, -137], [-133, -9, -107, -118, 31]]