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.
21, 29, ['q', '9551', '2901', 'P', 'd', '2765', 'j', 'q', 'i', '3681', 't', '7711', '3033', '3093', '9631', '6705', 'f', 'y', 'P', 'S', '945', 'i', '2181', '1303', 'B', 'E', '4595', '4175', 'C']