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.
2, 11, ['b', 'M', '6121', 'J', 'p', '9137', 'o', 'q', 'l', 'F', 'm', '643', '1129', '6795', 'G', 'K', '4491', 'B', '7533', 'b', 'r', 'x']