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, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']
[EX A]: 41208

[EX Q]: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']
[EX A]: 5121

[EX Q]: 7, 20, ['a', 'n', '5913', 'B', '7233', 'n', 'w', 'C', '5845', 'T', '4327', 'Z', '9369', '9241', 'I', '6423', 'c', 'W', 'R', '8665', '2377', '1579', 'J', 'z', 'f', 'r']
[EX A]:
43870