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.
[[31, 36], [43, 64, -8, 79, -49], [13, 51], [-152, -101, -15, 15, -147, -78, -168], [91, -71, -56, 62, -66, -4], [30, 32, -70, 90, -182]]