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.
[[-46, 49, 68, -10, 84, -42, -195], [-154, -192, -138, 39, -178], [2, -42, -31, -94, 98, -126, -35], [-65, 78, 79, -1, 76, -21, 75], [7, -180, -119, -62], [-119, -68, -157, -54], [-114, 56, -115, -124, -110, 98], [-87, -44, -109, 52]]