C++ || Simple solution
\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& horizontalCuts, vector<int>& verticalCuts) \n\t{\n        sort(horizontalCuts.begin(), h
```\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& horizontalCuts, vector<int>& verticalCuts) \n\t{\n        sort(horizontalCuts.begin(), horizontalCuts.end());\n        sort(verticalCuts.begin(), verticalCuts.end());\n        \n        horizontalCuts.push_back(h);\n        verticalCuts.push_back(w);\n        \n        long long int x = horizontalCuts[0];\n        long long int y = verticalCuts[0];\n        \n        for(int i=1 ; i<horizontalCuts.size() ; i++)\n\t\t{\n            if(horizontalCuts[i] - horizontalCuts[i-1] > x)\n                x = horizontalCuts[i] - horizontalCuts[i-1];\n        }\n        \n        for(int i=1 ; i<verticalCuts.size() ; i++)\n\t\t{\n            if(verticalCuts[i] - verticalCuts[i-1] > y)\n                y = verticalCuts[i] - verticalCuts[i-1];\n        }\n        \n        return (x % (1000000000 + 7) * y % (1000000000 + 7)) % (1000000000 + 7);\n    }\n};\n\n\n```
['C']