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.
[[-39, -180, -166, -168, -42, -94], [-196, -68, -199, 44, 54, -123], [17, -38, -165], [85, -54, -15, -59, -168, 4, 64], [-177, -119, -18, -28, 81], [-182, -91, -115, 92], [-119, -30, -8, -110, -37]]