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.
6, 21, ['4159', '4789', '1567', 'G', 'Z', 'c', '4341', '5697', 'R', 'n', '8375', '1481', '3909', 'p', 'p', '4055', 'G', 'S', 'D', 'Z', '3229', '649', 'a', 'q', '1549']