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.
3, 11, ['4893', 'l', 'R', '9257', '797', 'q', '85', '5783', 'p', '3365', '55', 'H', '2839', '451', 'y', 'U', '3265', 'w', '1361', 'k']