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.
21, 24, ['4245', 'o', '6535', '8353', '2669', '9067', 'R', 'o', '3955', '8165', '4953', 'Q', 'z', 'c', '5251', '6355', '4423', 'z', '7291', 'f', 'C', '6557', '5101', 'C', '7617']