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.
4, 26, ['3693', 'Q', '4405', '2717', 'h', 'T', 'D', 'C', 'y', '7497', '6267', 'L', '7479', '8825', '1109', 'l', '3067', 'v', '7733', 'i', 'e', 'b', '9313', 'L', '4665', 'E', '8845']