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]: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
[EX A]: 0

[EX Q]: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']
[EX A]: 0

[EX Q]: 1, 12, ['G', 'o', '4165', 'j', 'A', '2911', '7501', 'n', 'x', '5065', 'i', '7361']
[EX A]:
27003