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, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
[A]: 0


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


[Q]: 1, 17, ['5951', '6673', '7333', '8243', 'l', 'H', 'N', 'S', '9839', 'h', 'z', '5517', 'e', 'b', 'u', 'R', 'r', 'g', 'v', 'X', '8161', 'z']
[A]:
43556