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.
6, 26, ['z', 'c', '2049', 't', '2187', 'r', 'z', 'd', 'D', '9773', 'E', '8521', '5327', '8889', 'd', '6301', 'T', 'M', '9101', 'r', '7449', 'X', '8675', '4755', '13', '8549', '2117']