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, 12, ['m', '3265', 'd', 'i', 'o', 'b', 't', 'E', 'L', '5411', '9447', '1779', 'A', '8423', '2035', '5137', 'N', '3361', '9797', 'p', '3443', 'M', '7237', 'n']