In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
19229

3, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']
35341

7, 8, ['3123', 'W', '2511', '8845', '1723', '381', '2317', 'p', 'Q', '477', 'G', 'o', '5389', 'y', 'p', '515', '6803', '8587', '1851', 'U', '7901', 'k', 'I', 't', 'q', 'b', 'D']

2317