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.
11, 21, ['8435', '2523', '8549', 'j', 'n', '8141', 'W', 'g', 'n', '9235', 'a', 'k', '3335', 'f', 'd', '5701', 'x', '8767', '891', 'W', '8271', 'z', 'W', '2517']