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.
22, 27, ['8035', 'O', '3213', 'B', '5319', '1921', 'e', 'B', '811', '1423', 'D', 'l', '3803', '4061', 'v', 'o', '8943', '199', 'X', '2693', 'N', '4225', 'z', '3055', '8587', '2347', 'S', 'l']