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.

16, 20, ['7527', '5121', 'Q', '4585', '9735', 'Y', 'e', 'p', '755', '8605', 'B', 'O', 'X', '3887', 'M', '8347', '2391', 'v', 'F', '5509', 'e', 'g', 'm', 'j', 'P', 'J']
16247

2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
19229

9, 21, ['B', 'r', 'm', 'Z', 'H', 'v', 'g', '3691', '9175', 'o', '5523', 'l', 'j', 'M', 'O', '7397', '9903', 'j', 'Z', '2647', 'P', '8817']

34645