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: 3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']

A: 283
****
Q: 1, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']

A: 0
****
Q: 5, 12, ['1765', '4055', 'L', '8757', 'I', '851', 's', '8801', 'I', 'P', 'O', 's', 'f', 'e', 'u', '1019', 'z', '7509', 'H', 'b', 'u', 'K', '423', '8225']

A:
9652
****