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: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']

A: 0
****
Q: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']

A: 30392
****
Q: 10, 23, ['K', '8825', 'v', 'a', 'S', '9107', '8139', '979', '6719', 'P', 'd', 'd', 'X', '7409', 'i', 'd', 'a', 'E', '3715', 'T', '8457', 'r', '7389', 'N', '2293', 'o', '1881']

A:
26970
****