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.
[[28, -176, -70, -39], [-160, -15, 62, 87, 55, -28, -8], [-182, -170], [-64, 69, 97, 11, -13, -27, -5], [-18, -97, 53, -42, 88], [13, -114], [-13, -73, -53], [60, -126]]