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.
3, 8, ['3707', '417', '5939', '843', '6775', '8529', '1245', 'k', 'c', '7451', 'J', '4121', 'o', 'z', '989', 't', '4409', 'I', 'V', '9945', 'k', 'J', 'w', '6761', 'p']