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.
[[-83, -45, -141, 94, -51, -181, 34], [-22, -17, 33, 75], [-119, 82, 23, -101, -126, -195], [3, -49, 19, -193, -66], [0, 75, 82, 39, -109, 78], [-10, 38, 18, 16, 58], [-1, -39, -158, 38]]