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.
[[25, 99, -110, 86, -78], [-126, 23, 86, -11, 2, -164], [-110, -127, 4, -71, -124, 40, -42], [-157, 91], [37, 5], [31, -145, -140, -164, 99], [87, -34, -100, 8, 48], [89, -123, -143, 51]]