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.

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


[Q]: 9, 13, ['6195', 'k', '6835', 'u', '4049', '3063', 'N', 'q', 'R', 'Y', '8573', 'r', '2037', 'w', 'D', 'Y', '9849', 'T', '2245', '6999']
[A]: 10610


[Q]: 4, 8, ['2629', 'g', '377', '389', 'e', 'J', '9353', '8869', '6059', '3967', '5787', '4993', '3041', 'E', '595', '707', '7189', 'w', 'Z', 'V', 'T', '5199']
[A]:
18611