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.
[[-110, 1, 54, -196, -180, -52], [-157, 99, -42, 64, 18], [93, 90, -79, -72, -27, -176], [56, -67, 69, -24, 71], [81, -134, -190, 96, -123, -70], [34, 76, -33], [-73, -18, 15, -5]]