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: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']

A: 30392
****
Q: 2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']

A: 9180
****
Q: 12, 13, ['Q', '8643', '4913', 'Q', 'g', '9093', 'K', '4311', 'i', 'u', '3907', '5031', '6641', 'K', 'E', 'w', 'J', '2853', '6627', '6427', '6301', '7907', 'f', '2975', 'd']

A:
11672
****