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.
8, 9, ['F', 'G', '8551', 'R', '5229', '9767', '9165', 'g', '8697', 'j', 'f', '8393', '1089', '9027', 'Q', 'z', '1085', 'y', 'n', 'b', '8581', 'g', 'z', 'R']