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.
5, 11, ['V', '3165', 'i', '7769', 'j', '3861', '6521', '9667', 'h', 's', 't', 'm', 'C', '4409', '8213', '5005', '9071', 's', 'g', 'A']