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, 20, ['m', 'h', 'f', 'p', '5595', 'y', 'B', '6551', 'H', 'Q', 'e', '3177', 'k', 'f', 'p', '8409', 'o', 'N', 'P', '8977', '4159', 'i', 'F', 'H', '6549', 'B']