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.
[[49, -57, -121, -133, 30, -65], [-55, -147], [-27, -121, 26], [75, 86, -84, 67, 10, 23, -31], [-12, -187, -168], [-119, 0, -134], [-170, 77, -99, -176, -6, -100], [-135, -110, -193, 43, -53, -172, -82], [12, -7, 71, -147, -60, -190, 57]]