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: 21, 23, ['211', '959', '3183', '1605', '3217', '6793', '2239', 'Z', 'T', 'f', '2559', '9249', 'X', '6925', '4373', 'j', 'H', '9575', '3481', 'W', 'p', 'v', 't', '5995', '8765', '201', 'F', 'O', '7251', 'S']

A: 0
****
Q: 2, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']

A: 4591
****
Q: 4, 6, ['4559', '9811', '5741', 'F', 'G', 'l', '9125', '9431', 'k', 'W', 'K', 'k', 'G', '1145', 'P', 'R', '4453', 'J']

A:
0
****