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]: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']
[EX A]: 0

[EX Q]: 4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']
[EX A]: 20400

[EX Q]: 2, 6, ['1905', '5325', '4425', 'N', 'D', 'y', '1297', '8825', '745', 'p', 'k', 'f', 'b']
[EX A]:
9750