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, 26, ['5141', 'c', 'c', 'K', '3639', '4487', 'G', '8839', 'F', '6699', '9171', '9409', 'm', 'N', 'E', '6055', '6819', 'c', 'r', 'u', '2475', 'q', 'F', '319', 'g', '2923', 'o', '6315', '8335']
[A]: 60835


[Q]: 2, 2, ['E', 'i']
[A]: 0


[Q]: 2, 3, ['2869', 'o', 'J', '6479']
[A]:
0