class Solution {
public:
    vector<int> arrayChange(vector<int>& nums, vector<vector<int>>& operations) {
        reverse(operations.begin(), operations.end());
        map<int, int> m;
        for (auto i : operations) {
            m[i[0]] = i[1];
            printf("%d %d\n", i[0], m[i[0]]);
            if (m.find(m[i[0]]) != m.end())
                m[i[0]] = m[i[1]];
        }
        for (auto& i : nums) {
            if (m.find(i) != m.end()) {
                i = m[i];
            }
        }
        return nums;
    }
};