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: 2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']

A: 51416
****
Q: 1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']

A: 11266
****
Q: 12, 13, ['6565', '4087', 'D', 'm', 'Q', '4597', 'i', 'E', '6295', 'C', '3329', '287', 't', '4567', '9297', 't', 'Y', '9905', 'B', 'H', '8415', '4563', '3939', '3231', 'z', '2227', '6661', 'C', 'w', 'b']

A:
287
****