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.
[[-138, -173], [-101, -53, -70, 74, -58, -45, 33], [49, -168, -95, -96, -110], [-141, 13, -92, -62], [-25, 7, -155, 25, -112, -188, -34], [-50, -93, -121, 38, 38], [-46, -186, 42, -160, -146, -140], [8, -143, -107, -6, -105, -2, 35], [21, -40, -144, 72]]