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: 7, 12, ['273', 'h', '2433', '7155', '731', '5459', 'q', 'G', 'i', 'l', '3981', 'W', 'V', '4999', '8191', 'K', '8393', '9255']

A: 3981
****
Q: 4, 8, ['3753', 'y', '417', 'B', 'g', 'D', 'L', '6175']

A: 6175
****
Q: 7, 15, ['2573', 'n', 's', 'n', '8475', '5095', '8749', '5453', '6381', 'k', '4019', 'k', '627', 'U', 'T', 'x', '8497']

A:
25229
****