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, 21, ['7437', '4587', 'c', '2067', 'T', '7195', '1551', 'o', '9403', '6459', '7877', 'W', '9219', '2233', '4197', 'c', 'x', '5635', '2153', 'V', '3493', 'A', '5853', 'O', '2931']