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.
24, 26, ['m', 'p', '9441', 'a', '3511', '9953', '5973', '4475', 'c', 'X', '4793', '3811', 'm', '9933', 'T', 'k', 'o', 'I', 'c', '1311', 'h', 'h', 'R', '7815', '6499', '1183', '2881', 'i', '803', 'O']