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.

1, 2, ['4857', '6373']
11230

11, 12, ['2735', '2057', '8217', '7745', 'p', '165', 'e', 'g', 'c', '2391', '523', 'R', '1009']
523

11, 15, ['8377', 'G', '129', '7381', '6111', 'c', 'J', 'W', '6813', '2513', '9477', 'Y', 'z', '9879', 'u', 'E']

19356