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.
12, 13, ['i', 'M', 't', 'D', 'R', '581', '2765', 'G', '4317', 'y', 's', 'w', '4645', 'V', 'G', '7569', '5935', '7361', '1661', '2513', '6483', 'W', '6527', '1561', '7385', 'w']