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, 23, ['V', '3741', 'v', 'N', 'a', 'S', 's', '4845', '7637', 'M', '1195', 'Y', 'D', 'q', 'd', 'Q', 'N', 'z', 'Z', '3027', '5959', '9009', '5381', '4031']