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.
11, 21, ['2461', 'U', '4893', '227', 'y', '9975', 'p', '9477', 'D', 'N', 'a', '6779', 'T', '4081', 'p', '2893', '6417', 'b', '6373', 'B', '4705', '8117']