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, 2, ['P', 'n', 'd', '645', 'S', 'a', 'h', '6753', '5367', 'u', 'k', '8303', '7761', '9821', '447', 'j', 'Q', 'h', '5209', 'V', 'I', 'k', 'Q', 'i', '8943', 'X', '6643', 'M']