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]: 4, 12, ['k', '7775', '1099', '1507', '7609', 'X', 'O', '521', 'u', 'V', 't', '1935', '8171', '2063', 'h', '2961', 'z', '4955', '1359', 'm', '2137']
[A]: 11572


[Q]: 17, 22, ['D', '7897', '1603', 'L', '5485', 'S', 'V', '1361', 'a', '9131', 'm', 'V', 'l', 'v', 'Z', '4831', '9561', '1185', 'y', 'D', '1853', '2225', 'j', 'r']
[A]: 14824


[Q]: 4, 5, ['P', '3075', 'w', '7873', '783']
[A]:
8656