D. Swap Dilemma

Given two arrays of distinct positive integers 𝑎 and 𝑏 of length 𝑛, we would like to make both the arrays the same. Two arrays 𝑥 and 𝑦 of length 𝑘 are said to be the same when for all 1≤𝑖≤𝑘, 𝑥𝑖=𝑦𝑖.

Now in one move, you can choose some index 𝑙 and 𝑟 in 𝑎 (𝑙≤𝑟) and swap 𝑎𝑙 and 𝑎𝑟, then choose some 𝑝 and 𝑞 (𝑝≤𝑞) in 𝑏 such that 𝑟−𝑙=𝑞−𝑝 and swap 𝑏𝑝 and 𝑏𝑞.

Is it possible to make both arrays the same?