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.

5, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']
7459

8, 9, ['3587', '5903', 'B', '9671', 's', 'A', '7259', '6961', '2601', '9719']
9562

11, 24, ['g', '9839', 'd', 'h', 'W', '9993', 'D', '5031', 'P', 't', 'E', 'y', '7517', '4863', 'k', '691', 'R', 'g', 'B', '8461', '8649', 'n', '2967', '9193', '995', 'a', 'f', '885', 'e', 'W']

42341