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, 29, ['8221', '447', '5585', 'q', 'v', '947', 'y', 'd', 'V', '9291', 'U', 'K', 'L', '6177', 'q', 'P', '7341', '3135', '9993', '9203', 't', '4109', 'y', 'R', 'x', '9843', '1741', '9589', 'U']