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.
[[-86, -27, 55, -199, 70, -50, -34], [0, -185, -112, 38, 75, 63], [-117, -76, -27, 71, 39, -50], [9, -11, -176, -153, 47, -105], [36, 99, 22, 92, -67, -173], [49, 22, -110, -45, 20, -115], [-69, -142, -150, 18], [-13, -113, 14]]