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]: 23, 25, ['v', 'J', 'B', 'y', 'G', 'z', 'f', '1651', 'T', 'X', '8701', '701', 'T', 'V', '1037', '4095', '8297', '2733', 'P', 'J', '7759', 'Z', '8153', 'q', '7619']
[A]: 15772


[Q]: 2, 2, ['E', 'i']
[A]: 0


[Q]: 3, 5, ['x', '3951', '6543', 'T', '3063', 'a', 'A', 'A', 'a', '2211', 'r', 'N', '6983', 'D', 'd', 'B', 'k']
[A]:
9606