Python3 solution with modulo
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def areSimilar(self, mat: List[List[int]], k: int) -> bool:\n        copy = []\n\n        for m in range(len(mat)):\n            row = [0] * len(mat[0])\n            for n in range(len(mat[0])):\n                if m % 2 == 0:\n                    i = (n - k) % len(mat[0])\n                    row[i] = mat[m][n]\n                elif m % 2 != 0:\n                    i = (n + k) % len(mat[0])\n                    row[i] = mat[m][n]\n            copy.append(row[:])\n\n        print("Original")\n        print([row for row in mat])\n        print("Copy")\n        print([row for row in copy])\n\n        for m in range(len(mat)):\n            for n in range(len(mat[0])):\n                if mat[m][n] != copy[m][n]:\n                    return False\n        return True\n```
['Python3']