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.

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

[EX Q]: 1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']
[EX A]: 25374

[EX Q]: 18, 18, ['n', 't', 'z', '3877', 'U', 'j', '8867', 'R', 'r', '3041', 'v', '6219', '633', 'b', 'R', 'Q', '7519', '1833', '1123', 'h', '1521', 'l', '9511', 'c']
[EX A]:
1833