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]: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']
[A]: 29965


[Q]: 12, 18, ['9047', '1191', '7027', 'b', '1877', 'n', '337', 'n', 'o', '9007', 'd', 'F', '4929', '2707', 'B', 'y', 'o', '2859', '1609', 'N', 'w', 'H']
[A]: 10495


[Q]: 2, 8, ['h', 'B', 'A', '83', '1969', 'b', 'K', 'R', '5293']
[A]:
2052