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]: 1, 3, ['e', '1703', 'x', 'U', '873']
[EX A]: 1703

[EX Q]: 12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']
[EX A]: 22751

[EX Q]: 1, 11, ['4459', 's', '3429', 'D', 'G', '5335', 'e', 'X', '8481', '4921', '9149', 'Z', '2949', '5745', 'l', '9075', '2029', '1489', 'U', '1523', '8005', '3681', 'M']
[EX A]:
35774