A lot to Merge

Problem Statement

A lot to Merge Problem Description Nebula gave Groot an integer N and M and an algorithm to construct a matrix of size N*M. The matrix is constructed as follows: The entry at the intersection of i'th row and j'th column will be i*j. Once Groot is done making the matrix, Nebula asked him to take all the elements of the matrix and arrange them in ascending order. Now Nebula gave Groot an integer K and asked Groot to find the K'th element in the arranged list. You only need to implement the given function. Do not read input; instead use the arguments to the function. Do not print the output; instead return values as specified. The function signature is: int Solution::solve(int A, int B, int C) Where A , B , and C correspond to the input integers N, M, and K respectively. Examples Example 1: Input: N = 2, M = 2, K = 2 Output: 2 Explanation: Value of the Kth element is 2. Constraints 1 <= N, M <= 10 4 1 <= K <= N*M ```