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, 16, ['m', '5033', '7303', 'e', '5305', 'G', '8705', 'E', 'e', 'r', '9865', '7247', '8345', 'J', '3731', 'm', 'T', 'W', 'r', '1183', '5065', 'L', '2939', '5871', 'n', '8951']