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.
10, 29, ['7915', '6889', '3729', '1143', 'K', '4177', 'G', 'I', 'X', '751', '7859', '8171', 'M', '3347', '5631', '3911', 'R', '2105', '3855', '2009', 'X', '8881', 'l', '2893', '1005', '3473', '9215', 'p', 'W', 'c']