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.
7, 26, ['1249', '6761', '5859', 'R', 'J', '2279', 'u', 'l', '2791', '9343', 'E', '8273', 'I', 'u', 'Y', 'w', 'H', '1243', '8705', 'u', 't', 'm', 'W', '5667', '9189', 'F', 'C', 'C', '6595']