Beats 91.65% of solution with C++ ||****Jai Shree Ram*****
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    int n;\n    int m;\n    set<pair<int,int>>s;\npublic:\n    Solution(int m, int n) {\n        this->m = m;\n        this->n = n; \n    }\n    \n    vector<int> flip() {\n        int i = rand()%m;\n        int j = rand()%n;\n        while(s.count(make_pair(i,j)) > 0){\n            i = rand()%m;\n            j = rand()%n;\n        } \n        s.insert({i,j});\n        return {i,j};\n    }\n    \n    void reset() {\n         s.clear();\n    }\n};\n\n/**\n * Your Solution object will be instantiated and called as such:\n * Solution* obj = new Solution(m, n);\n * vector<int> param_1 = obj->flip();\n * obj->reset();\n */\n```
['C++']