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, 12, ['8519', 'c', '7575', '1517', '2735', '4339', '7765', '6455', 'D', 'G', '2437', '9663', '3765', '299', 'n', '7921', 't', 'M', 'l', '515']

A: 42486
****
Q: 1, 2, ['E', 'z']

A: 0
****
Q: 16, 25, ['U', 'N', '6639', 'P', '3003', 'd', 'p', '9897', 'b', 'r', '5571', '4623', 'D', '2923', '4457', '3951', 'D', '5715', '7459', 'e', '1315', 'n', '7075', '6671', '4367', '3425']

A:
36553
****