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.
9, 11, ['9643', '5097', '429', 'F', '2011', 'f', 'l', '8779', '7607', '3457', '8271', '3435', 'S', 'e', '2141', 'R', '4979', '8963', 'v', '3923', '7209', '6557', '7973', '1913', 'M']