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: 1, 8, ['O', 's', '3399', '1813', 'T', '4477', '7161', 'z', '1173', 'Y', '6051', '7509', 'i', '9765', '809', '6191', 'f', '1983', 'm', '1043', '8465', '9511', 'i', 'p', '4891', 'K', 'W', 'W', '239']

A: 16850
****
Q: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']

A: 26471
****
Q: 4, 12, ['4655', 'c', '6617', '9009', 'h', 'S', 'S', '6321', '1611', '9813', '7961', 'T', '9159']

A:
34715
****