For those who are finding it difficult to understand the problem statement!
To simplify this question \nGiven a matrix of n rows and m columns, and provided input coll(which is the number of columns you have to pick)  , you can choose a
## To simplify this question \nGiven a matrix of **n** rows and **m** columns, and provided input **col**l(*which is the number of columns you have to pick*)  , you can choose any combination of colums (example say you have a matrix of columns 3) and given col input is 2 you can either choose **(12 , 13 , 23)** ie **3C2** for these elements in the set you have find max rows covered \n**Definition of Row covered:** For a given row for every cell which contains 1 it has to belong to one of the columns in the chosen combination of colums in the set ,if 0 is present you can neglect those cells.\nFor the maximum Row covered you have to iterate through all the combination of the column set possible **[12 , 13 , 23]** in this case and check the rows covered in these sets and return the maximum of them\n\nExample test case\n<img width="200" src = "https://assets.leetcode.com/uploads/2022/07/14/rowscovered.png">\n\nHere choosing **(1,3)** out of **(12,13,23)** will yield you max rows covered \n\nLets take **(13)**\n**First row** :      [0 , 0 , 0 ] all zeroes no need to check already covered - **1** row covered\n**Second row** : [1 , 0 , 1] : both 1\'s are at column 1 and column 3 which are in your column combination **(13)** - **2** rows covered\n**Third row** :    [0 , 1 , 1] :  first 1 is at 2nd column which is not in our column combination **(13)** so not covered ,no need to check for other cells\n**Fourth row**    [0 , 0 , 1] first 1 at **3** which is in our column combination **(13)** so covered\n\nThe maximum rows covered is **3**, you can try for other column combinations **12** and **23** and the result will be less than or equal to 3 so return **3** as the answer.
[]