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: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']

A: 5085
****
Q: 1, 15, ['p', 'N', '7935', '1649', '1509', 'N', 'q', 'L', '1917', '9753', 'C', '6387', '4037', 'D', '1099', '5329', '1703', '7715', 'c']

A: 34286
****
Q: 14, 15, ['x', '3207', '2669', '5423', '4985', 'l', '1565', '9029', '6065', 'w', '7185', '8727', 'G', '1357', '6919', '6469', '7593', '8259', '7883', 'g', '6793', 'H', 'R']

A:
8276
****