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]: 14, 29, ['1447', 'P', 'X', '5411', '4235', 'K', '6749', '171', '9349', 'K', 'n', '3477', '1183', '9933', '6259', '5793', '1719', 'V', 'C', '1983', '9947', 'I', 'c', '4425', 'Q', 'v', 'a', '3783', '9665', 'z']
[A]: 53507


[Q]: 9, 12, ['8515', '4987', '7905', 'K', 'u', '2791', 'o', '8955', 'j', 'x', 'e', 'Z', '6231', '4913', '7933', '4079', '2945', '475', '6415', 'V', '8767', 't', 'c', '919', 'M', '5501', 'y', 'S', 'L', 'Q']
[A]: 0


[Q]: 1, 4, ['k', '6695', '7761', '8573', 's', '8435', 'y', '4929', 'A', 'C', 's', '5693', 'G', '843', 'P', 'i']
[A]:
23029