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.
20, 24, ['8491', 'I', 'L', 'T', '2595', 'z', 'W', 'f', 'l', 'B', 'A', 'I', '8547', 'H', '5257', 'x', 'O', '2467', 'A', '9447', 'o', 'w', '3893', 'R', '4045', 'B']