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, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']
14716

9, 15, ['9375', '9663', 'i', '9607', '4257', '9757', 'r', '937', 'm', 's', '9193', '2269', '4627', '2051', '7045']
25185

1, 1, ['3783', 'j', 'n']

3783