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: 9, 16, ['v', '5691', '4973', 'J', 'w', '539', '6957', '9953', 'L', 'c', '5879', 'b', 'g', '6681', 'C', '753', '5835', '1023', 'w', '5713', '159', 'X', 'z', 'i', '8379', '9753', '195', 'X']

A: 13313
****
Q: 2, 6, ['m', 'q', '4069', '4487', 'c', '4639']

A: 13195
****
Q: 1, 4, ['J', '4755', '7579', 'i', '6307', 'k', 'I', 'b', 'F', 'K', 'R']

A:
12334
****