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.

6, 21, ['N', '875', 'r', '1847', 'j', 'a', '5885', 'g', '5031', 'Q', '2723', '1445', 'x', 'm', 'e', '4513', 'O', '371', 'e', '8201', '7431', 'B', '9617']
35600