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, ['3401', '3861', '8345', 'Y', '6905', '9905', '1407', '6513', 'O', 'P', '3877', '3605', '4843', '6741', '2759', '9515', 'z', '5555', '7927', '2207', 'b', '3805', '307', '6891', 'm', 'u', '1713', '8089']