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.
2, 13, ['m', 'C', 'y', '265', '5995', '2991', '3481', '5975', '1317', 'P', 'v', 'q', '5737', 'n', 'k', 't', '6149', '3977', 'V', 's', 'Q', 'E', '2073', '6949', 's', 'f', 'Y']