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]: 9, 17, ['9485', '5729', 'N', 'v', 'H', 'j', 'K', 'D', 'R', '2515', 'O', '2001', '9877', 'p', 'Y', '8407', '647']
[A]: 23447


[Q]: 7, 9, ['r', '1053', 'o', 'J', 'Z', 'G', 's', '9007', 'p', 'Z', '3847', 'Y', 'p', '7999', '1735', 'J', 'n', 'o', '5155', 'U', 'l', 'l', '4321', '481']
[A]:
9007