Suppose that a disk drive has $3,000$ cylinders, numbered $0$ to $2999.$ The drive is currently serving a request at cylinder $343,$ and the previous request was at cylinder $325.$ The queue of pending requests, in FIFO order, is: $186,470,913,774,1948,509,1022,750,1130.$ Starting from the current head position, what is the total distance $($in cylinders$)$ that the disk arm moves to satisfy all the pending requests if the SSTF algorithm is used? Show your work.