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.
[[-23, 16, 70, -136, -157, -4, -173], [8, -178], [-61, 59, -176, 30, -15, -196], [-98, -166, -9], [-19, 78, -194, -183, -15], [45, -116, 18, -53, -197, -60]]