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, 15, ['8195', '9681', 'X', 'M', 'k', 'A', 'N', '6717', '2431', 'Z', 'u', '439', '6633', '983', '2315', '2831', '5721', '6633', 'k', 'u', '6449', '9053', 'O', 'm', 'c', 'j', 'l', '3975']