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, 8, ['n', '7861', 'F', 'z', 'W', '4245', 'H', '4559', 'm', '7071', 'l', 'B', '1857', 'f', 'l', '9137', 'Z', '3167', '8305', '3325', '219', '1257', 'j', '7219', '5797']