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, 16, ['P', '8933', '2757', 'y', 'p', '6687', '6903', 'S', 'b', '7221', 'V', 'B', '3633', 'G', '1209', 'J', '641', '1449', 's', 'w', 'C', '5801', 'Y']
[A]: 25653


[Q]: 2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']
[A]: 24001


[Q]: 6, 23, ['V', '3741', 'v', 'N', 'a', 'S', 's', '4845', '7637', 'M', '1195', 'Y', 'D', 'q', 'd', 'Q', 'N', 'z', 'Z', '3027', '5959', '9009', '5381', '4031']
[A]:
37053