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]: 10, 12, ['465', 'V', '3045', 'M', 'Z', '4053', '9621', '6909', '3161', 'M', '6675', '2313', 'v', 'g', 'a', 'x', '9347', 'd', 'x', '4309', '7231', '9745', 'F', '8863', '4667', '2089', 'x']
[EX A]: 8988

[EX Q]: 4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']
[EX A]: 129

[EX Q]: 2, 19, ['Y', '5315', '551', 'o', '1407', '355', '29', 'h', 'D', '1249', 'Q', '5427', '6325', '1359', 'a', 'T', '9223', '4227', '1397', '8869', '7633', 'H']
[EX A]:
36864