Note.ms

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define mem memset
#define pin(c) scanf("%lld",&(c))
#define forin for(int i=1;i<=n;i++)
#define forim for(int i=1;i<=m;i++)
#define forjn for(int j=1;j<=n;j++)
#define forjm for(int j=1;j<=m;j++)
#define forkn for(int k=1;k<=n;k++)
#define forkm for(int k=1;k<=m;k++)
#define Forx(c,l,r,p) for(int (c)=(l);(c)<=(r);(c)+=(p))
#define Fory(c,l,r,p) for(int (c)=(l);(c)>=(r);(c)-=(p))
const int N=1e2+10;
const int INF=0x3f3f3f3f;
int a[N][N];
int n,q,c;
int f1(){
	for(int i=1;i<n;i++) swap(a[i],a[i+1]);
}
int f2(){
	for(int i=n;i>1;i--) swap(a[i],a[i-1]);
}
int f3(){
	for(int i=1;i<n;i++) forjn
		swap(a[j][i],a[j][i+1]);
}
int f4(){
	for(int i=n;i>1;i--) forjn
		swap(a[j][i],a[j][i+1]);
}
int f5(){
	int t[N][N];
	forin forjn t[j][n-i+1]=a[i][j];
	forin forjn a[i][j]=t[i][j];
}
signed main(){
	cin>>n>>q;
	forin forjn cin>>a[i][j];
	for(int d=1;d<=q;d++){
		cin>>c;
		if(c==1){
			f1();
		}else if(c==2){
			f2();
		}else if(c==3){
			f3();
		}else if(c==4){
			f4();
		}else if(c==5){
			f5();
		}else if(c==6){
			f5(); f5();
		}else f5(),f5(),f5();
		forin{
			forjn cout<<a[i][j]<<" ";
			cout<<"\n";
		}
		cout<<"\n";
	}
	return 0;
}

Note.ms/Pbaoli