procedure will be:
BaseAddress + traverse till A[19] (which is 3D array) then for A[20] traverse till A[20][0][9] then finally traverse A[20][9][10]
therefore the next address will be A[20][10][10]
1000 + (19*(30*20) + 9*20 + 9)*2
NOTE- In question nothing is mentioned about size of element so I've assumed it to be 2 Bytes as address is integer, which is 2 Bytes.