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: 12, 23, ['A', 'i', '4191', 'B', '2297', '3959', '1125', 'c', '739', '7887', 'p', '8173', '5301', '1969', '9737', '7011', '9845', 'r', '2977', 'z', 'Q', 'N', '3847', 's', 'D', '3391', 'T']

A: 48860
****
Q: 2, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']

A: 4591
****
Q: 5, 11, ['D', 'P', 'e', 'S', 'o', 'z', '5999', '4447', 'q', '7063', 'n', 'r', 'J', 'H', '4665', '8885', 'B', '1375', '3061', 'i', 'f', '5535']

A:
17509
****