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, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']
[A]: 35341


[Q]: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']
[A]: 29965


[Q]: 9, 15, ['1579', '7535', '2507', 'm', 'j', 'P', 'p', '4477', '8335', '3579', 'q', 's', '7291', 'h', 'R', '8343', 'K', '3113', '9725', 'R', '7075', 'A', 'k', 'y']
[A]:
19205