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.

17, 21, ['7037', '9447', 'f', 'R', '1237', '5735', '1327', '1371', 'd', '3025', 'B', '9165', '3447', '6135', '3315', 'l', '8069', 'g', 'H', 'e', '4523', '3149', 'H', 'o', '3947']
12592

8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']
203

6, 16, ['R', '5621', 's', '8007', 'J', 'y', '5699', 'h', 'V', '6541', 'T', 'z', 'z', 'x', '3243', 'K', '8851', 'z', 'j', '2483', 'u', 'b', 'l', '9481', '7263', '4769', 't', 'y']

15483