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.
[[91, 35], [-166, -50, 72], [-84, -194, -34, -60], [-113, -7, -138, 40, 71, -80, -60], [57, -73, 91, 51], [17, -134], [59, -30, 44], [-45, -190, -124]]