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.

Example Input: 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']
Example Output: 35341

Example Input: 2, 2, ['9797', '5585', '1849', '4485', '9225']
Example Output: 5585

Example Input: 2, 3, ['h', 'G', 't', 'r', 'y', 'B', 'G', 'M', 'r', 'M', '7065', 'D', '7449', 'g', 'D', 'V']
Example Output:
0