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.
[[-156, -2, 99, -91, 48, -174, -21], [43, -134, -84, -120, -107, 46, -131], [-138, -35, 54, 97, -58, 15], [-40, -61, -2, -13, 62, -116, 50], [4, -129, 50, -112, -17, -193, -104]]