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]: 3, 5, ['u', 'Y', '4165', '1421', '7617']
[EX A]: 13203

[EX Q]: 2, 3, ['3335', '3451', 'f', 'M']
[EX A]: 3451

[EX Q]: 8, 16, ['573', '8213', 'u', 'a', '3839', 'b', 'F', '5217', 'h', '1511', 'n', 'S', 'h', 'C', 'D', 'g', 'r', '6847', '4269', '2853']
[EX A]:
6728