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, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']

A: 55494
****
Q: 2, 3, ['3335', '3451', 'f', 'M']

A: 3451
****
Q: 12, 26, ['733', '5899', 'u', '3239', 'a', '5165', 'e', '7253', '4321', 'W', 'u', 'P', '1021', '2195', '9413', 'q', 'a', 'm', 'U', 'v', 'H', '3363', '2249', 'A', '7431', 'l', '4439', '753']

A:
25672
****