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, 14, ['a', 'i', '5431', 'U', '9109', 'm', 'H', '7643', '127', 'a', 'S', '4285', '5625', '5479', '6409', 'U', 'n', 'R']
[A]: 5479


[Q]: 9, 17, ['9485', '5729', 'N', 'v', 'H', 'j', 'K', 'D', 'R', '2515', 'O', '2001', '9877', 'p', 'Y', '8407', '647']
[A]: 23447


[Q]: 11, 21, ['Z', 'z', 'm', 'I', '8249', '7661', '8397', 'k', '27', 'p', '6015', 'Y', '537', '5153', 'q', 'f', 't', '807', '2087', 'Z', '4483']
[A]:
19082


