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]: 2, 3, ['3335', '3451', 'f', 'M']
[EX A]: 3451

[EX Q]: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']
[EX A]: 0

[EX Q]: 10, 11, ['r', 'Y', '8963', '6625', 'b', '4531', '977', 'F', 'M', 'w', '1731', 'h', 'T', 'T', '4089', '7047', '7641', '6845', '8275', 'R', '7877', 'p']
[EX A]:
1731