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.

Ex Input:
4, 8, ['3573', '9813', '3867', 'i', '5291', '1987', '9811', 'A']

Ex Output:
17089


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

Ex Output:
9892


Ex Input:
2, 15, ['l', 'U', 's', 'G', '531', '4105', '3455', '6761', '5437', 'K', 'O', 'l', 'W', '9653', '925', '351', '607', 'h', '8507', 'E', '721', 'i', '9773', 'l', 'C', 'M', '9559']

Ex Output:

30867