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.

1, 15, ['p', 'N', '7935', '1649', '1509', 'N', 'q', 'L', '1917', '9753', 'C', '6387', '4037', 'D', '1099', '5329', '1703', '7715', 'c']
34286

4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']
439

17, 18, ['4843', 'i', 'm', 'i', 'x', 'q', 'F', '943', 'H', '3103', 'V', '1393', 'z', '1735', 'm', '5169', '5587', '4699', '4683', '2159', '6083']

10286