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.
16, 22, ['k', 'v', 'k', '3067', '9431', 'J', '4477', 'Q', 'v', '3229', '6125', 'q', '1579', '4399', 'a', 'c', 'J', '3199', '5097', '1039', 'u', 'N', '1269']