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]: 5, 10, ['8553', '4157', 'm', 'Q', 'u', 'j', 'X', 'r', '8579', '255', 'A', 'g', '7017', '5707', 'd', 'O', 'V', 's', 'p', '337', 'F', '5439', '5715', 'c', '2615', 'l', '3537']
[A]: 8834


[Q]: 2, 4, ['X', 'o', '8807', 'r', 'q', '825']
[A]: 8807


[Q]: 8, 9, ['3877', 'e', '1315', '2015', '8263', 'Q', '9943', '475', '7035', '755', '2231', '9811', '7997', 'i', '3087', 'y', 's', '8247', 'y']
[A]:
7510