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.

4, 15, ['9021', '2343', '1041', '131', '9027', 'Q', 'v', 'j', '9391', '653', 'p', 'L', '4653', '6163', 'H', 'x', 'N', 'u', 'f', 'L', '6035', 'C', '5355', 'e']
30018

10, 13, ['z', 'h', '141', '7351', '3683', '2199', '1981', '107', 'Y', 'E', 'G', 'P', '9677', 'O', 'e', '1661', 'f', '1367', 'b', '8531']
9677

12, 20, ['z', 'L', 'D', 'G', '1547', '8885', 'M', 'F', 'e', 'Z', '4011', '6795', '6165', 'o', 'y', 'L', 'g', 'Q', '4245', '7279', '2543', 'p', '1331', '9805']

24484