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.
12, 21, ['8167', 'i', 'w', '4551', 'W', '2739', '1261', 'Z', 'q', 'y', '3911', 'Q', '1249', '3131', '9725', 'e', '4191', 'c', 'h', 'K', '5229', '8791', 'Y', '613', '1577', '3405', 'L', '4435', 'f']