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.
26, 28, ['3881', '7029', 'l', '3807', 'J', 'v', 'M', 'T', '25', '1975', 'l', 'b', 'U', 'W', '4107', 'K', '4629', 'o', 'm', '8413', '6841', 'Z', '6671', '2711', '1825', 'g', '2795', '1459', '639']