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, 2, ['1907', '1489', 'm', '4571', 'a']
[EX A]: 3396

[EX Q]: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
[EX A]: 6933

[EX Q]: 4, 7, ['5089', 'h', '7071', 'w', '9659', '7843', '5169', '4245', '8595', 'q', '8013', 'a', 'Z', 'r', '3579', '5139', 'm', 'U', 'a', 'H', '3553', '7969', 'N', 'Z', 'F', '9283', 's', '2675', '7609', 'C']
[EX A]:
22671