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.
8, 21, ['i', '7317', '4585', '7585', 'N', '4359', 'u', 'C', 'T', 'J', '8997', '315', 'C', '8701', '4377', '4603', 'm', '95', '8371', '6499', '6125', '7615', 'M', '6735']