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, 12, ['N', '8957', '1811', 'r', 'l', '1243', '8245', '6119', '2135', 'M', 'R', 'b', 'M', '8189', 'I', 'O', 't', '8367', 'C', 'D', '9977', '4687', 'b', 'Y', 'L', 'b', 'U', 'i', '839', '2069']