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.

7, 12, ['3713', 'N', '7191', '73', '4595', '6537', 'H', 'v', 'H', '8531', 'k', 'H', 's', 'x', 'R', 'd', '507', 'C', '9649', '8875', '7931']
8531

3, 18, ['h', 'x', '371', 'i', '8545', '7767', '5033', '1041', 'A', '4643', 'L', '187', '5017', 'x', 'R', '7891', '3919', '9721', '8625', '5817', 'D', '4825', 'S']
54135

3, 9, ['z', '2043', 'Y', '4999', '9935', '7493', 'E', '5411', '2449', '2697']

30287