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, 19, ['1889', '5433', '8071', 'Q', '2335', 'Z', '131', '9637', 'M', 'X', '2205', 't', 'n', '1191', '7129', '4851', 'b', 'f', 'a', 'z', '3207', '8567', 'x', 'f', '8587', '3243', 'K', '8765']