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, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']
[EX A]: 22632

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

[EX Q]: 2, 3, ['4013', '2445', '1105', 'C', '2807', 'E', '457', '3015', 'L', 'V', 'M', '8509', '5079', 'z']
[EX A]:
3550