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: 10, 22, ['4049', '2745', 'g', 'T', 'N', 'u', 'Q', '3687', '5871', 'i', '9139', '585', '8435', '5761', '5825', '5909', 'f', '6317', '8227', '4051', 'E', '5167', '6953', 'g', '4113', '2493']

A: 59416
****
Q: 3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']

A: 40356
****
Q: 13, 15, ['h', '4295', '7799', '9719', '991', '7773', '4045', 'W', '5143', '2705', 'U', 'h', 'H', 'c', '691', 'A', 'n', '5587']

A:
691
****