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.
[[95, -38, -156, 75], [-36, 70, 47, 50, -113, -60], [-86, -76, -98, 85], [33, -119, 64, -157, -19], [-81, 65, -132, -137, -104], [-40, 41, -184, 12]]