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.
[[79, -197, -123], [-118, -199], [-81, -142, 88, -128, -10, -61], [28, -191, -169, -103, -72, 16, -110], [21, -153, 1, -51, -136, -46]]