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, 13, ['i', '3441', '341', 'n', 'D', 'A', 'I', '4953', 'C', '2411', 'c', 'E', '2289', '7637', 'O', 'q', '277', '8077', '1335', 'I', '3883', '701', 'S']