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.
[[-22, -35, 13, -176, 31, 53], [55, 61, -168, -178, -187], [-89, -92, 76], [11, -86, -82, 38, 20, -100], [-150, -146, -5], [47, -91, -135, -192, -103, -20, -53]]