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: 9, 12, ['4189', '4575', 'i', 'e', 'Y', '5595', 'U', 'M', 'b', 'n', '5347', 'v', 'w', 'Z', 'F', '503', 'G', '4429', '3087', '295', 'W']

A: 5347
****
Q: 2, 5, ['9615', '7859', 'D', 'J', '1471']

A: 9330
****
Q: 5, 6, ['M', '6675', 'O', '8045', 'T', '6249', 'y', '5895', '4771', '4857', '205', 'R', '6403', '5759', '8909', '7001', '3271', '2869', 'l', 'F', 'b', '6897', 'c', 'r', '6051']

A:
6249
****