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.

11, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']
9892

4, 4, ['2227', '1525', 'g', 'l', 'R']
0

8, 9, ['9179', 'T', '5497', '6115', 's', 'z', '833', 'W', '9833', 'y', 'M', 'l', 'w', 'h', 'f', '1161', 'D', '7527', '3587', '9463', 'P', '7991', '3719', 'c', 'Z', '8457', '3155', '7269', '6015']

9833