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]: 2, 8, ['3651', '6881', '3701', 'M', '8543', '5995', 'q', 'A', 'S', '745']
[EX A]: 25120

[EX Q]: 3, 7, ['1811', 'Z', 'C', 'x', '6171', 'W', 'N', 'L', 'h', '4497']
[EX A]: 6171

[EX Q]: 2, 5, ['5195', '4857', 'T', '8969', '4559']
[EX A]:
18385