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.

9, 17, ['9485', '5729', 'N', 'v', 'H', 'j', 'K', 'D', 'R', '2515', 'O', '2001', '9877', 'p', 'Y', '8407', '647']
23447

1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']
0

1, 7, ['u', '4415', '7631', '8407', '6211', '7439', '8445', 'E', 'w', 'D', 'V', '8611', 'N', '1585', 'K', '3447', 'o', '7993', 'Y', '1605', '4531', 'g', '3789', 'e', '5493']

42548