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, 16, ['4071', '8789', '9693', '2003', '5279', '385', 'P', '5279', '8319', '4741', '3399', 'Y', '3449', '8517', '9069', 'h', '7255', 'W', 'W', 'v', '1739']