Problem I: Robot Puzzle Source file: robot.fclcppliava Input file: robot.in In this problem, your task is to determine how many possible distinct paths a robot located on the bottom-left corner of an N x M grid can try in order to reach the opposite top-right corner. Assume that the robot can only move either Up or Right Input The input to this problem starts with a number X describing how many cases are to be examined. Each case input consists of a single line containing the corresponding number of rows (N) and the number of columns (M), separated by a single space (you can assume that these 2 numbers are 25). Output For each input case, you have to output in a separate line an integer, representing the total number of all possible paths Sample Input Sample Output 35 24310 4 5 9 10