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, ['5605', '6415']
[EX A]: 12020

[EX Q]: 3, 19, ['4723', 'r', 'b', 'I', '7639', 'x', 'j', '1697', '8525', '4083', 'i', '1337', 'Q', '3705', '4229', 'L', '3721', 'g', '2569', 'j', '447', '2421', '9513', 'p', '6663']
[EX A]: 37505

[EX Q]: 3, 5, ['W', 'f', '1125', 'l', 'M', 'P', '509', 'w', 'J', 'C', 'o', '6445', 'U', 'U', '7645']
[EX A]:
1125