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, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']
[EX A]: 8337

[EX Q]: 4, 6, ['g', '8871', 'q', '597', '8871', '277', 'f', 'e', '2779']
[EX A]: 9745

[EX Q]: 2, 3, ['9773', 'e', 'G', 'm', '1859']
[EX A]:
0