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]: 5, 6, ['6675', '1045', '5697', '8385', 'R', '8979', '2187', 'L', 'w', '9711', 'e', '9789', 'f', 'c', 'C', '8189', '131', '8163']
[EX A]: 8979

[EX Q]: 2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']
[EX A]: 24001

[EX Q]: 2, 12, ['9999', 'Z', 'B', 'F', 'g', '8867', 'm', 'k', '9439', '9307', 'G', 'e', 'u', 'I', '2977', 'D', '4613']
[EX A]:
27613