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: 3, 15, ['i', '3795', '7239', '6365', 'i', '4003', 'v', '6905', '9227', 'u', 'e', '5621', 'M', '7481', '4721', 'I', 'e', 'o', 'K', 'f']

A: 51562
****
Q: 14, 29, ['1447', 'P', 'X', '5411', '4235', 'K', '6749', '171', '9349', 'K', 'n', '3477', '1183', '9933', '6259', '5793', '1719', 'V', 'C', '1983', '9947', 'I', 'c', '4425', 'Q', 'v', 'a', '3783', '9665', 'z']

A: 53507
****
Q: 1, 24, ['5911', 'j', 'f', 'B', '7279', '8025', 'P', 'L', '3555', 'E', '6287', 'H', 'a', 'C', 'c', '2939', 'k', '5181', 'F', 'z', '1653', 'X', 'V', 'Y', 'q', '345', 'K', '1365', '7167']

A:
40830
****