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.

17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']
1339

1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
7479

4, 7, ['8027', '3819', '9531', '61', 'c', '8385', '1973', '4843', '3875']

10419