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.
[[74, -117, -131, 51, -103], [56, -174, -127, -36], [42, -180, -128, 94, -130, -27, -66], [76, -16, -5, 100, -127, -36], [-185, -128, -103, 68, -46, -15, -14], [-77, -189], [40, -78, -30, -173, -124, -91], [15, -7, -21, 79, -125, 34, -58]]