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]: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']
[A]: 10058


[Q]: 21, 23, ['211', '959', '3183', '1605', '3217', '6793', '2239', 'Z', 'T', 'f', '2559', '9249', 'X', '6925', '4373', 'j', 'H', '9575', '3481', 'W', 'p', 'v', 't', '5995', '8765', '201', 'F', 'O', '7251', 'S']
[A]: 0


[Q]: 3, 6, ['N', 'F', 'W', 'L', '4833', 'm', 'm', 'T']
[A]:
4833