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.
9, 12, ['6909', 'A', '6293', '7641', 'Q', '6237', 'X', '8447', '7589', 'B', 'U', 'J', 'j', 'n', 'a', 'H', '299', '6645', 'j', 'Q', '51', 'B', '7481', 'h', '4417', 'F', '161', 'r']