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: 5, 8, ['3017', '2471', 'r', 'M', '8213', '4259', '8397', 'A', '9809', '5827', '4079', 'v', '6735', 'T', 'n', '3877', '9777', '1395', '9631']

A: 20869
****
Q: 1, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']

A: 26847
****
Q: 4, 13, ['U', '8959', '6569', '3385', '267', '11', '3057', '5237', 'l', '9497', '2507', 'k', 'n', 't', '6905', 'S', 'P', 'k', '1493', 't', 'k', 'b', 's', '5163', '8801', '325', '8027', 'G']

A:
23961
****