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.
13, 16, ['895', '5143', '4369', 'd', 'Y', 'k', 'D', 'c', '1221', '4681', '3073', '7229', 'j', '4475', 'b', 'P', 'A', '2427', 'K', '2961', 'n', '7293', '1573', '8473', 'F', 'l']