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, 9, ['157', 'T', '8965', 'd', '4291', '7101', 'I', '1733', '7305', '197', '2835', '6663', 'g', 'I', '9907', '9305', 'd', '8003', 'c']