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.
[[-119, -24, -38, -195, 81, -41], [-119, 96, -183], [-91, -25, -34], [10, -90, -53], [-75, 64, -20, -52, -58, -61], [-86, 13, 23]]