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.
[[-93, -139, -35, 48], [-33, 0, -35, 81, -155, 12], [10, -80, -9], [78, -67, -17, 61, -51, -59, -88], [-166, -24, -94, -60, -174, -183, -163], [49, -19, -142, -176, -99, -67, -17], [91, -180, -94, -95], [-164, -45]]