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.
2, 6, ['t', '8127', 'Y', 'g', 'W', 'H', 'x', 'C', '8403', '5605', 'c', 'l', 'a', 'R', '8505', 'E', '5927', '4171', 'r', 'L', '8499', '3803', '1949']