rt，全WA，请帮帮忙

#include<bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5, Mod = 1e9 + 7;
struct node
{
	int a[N][N];
	node()
	{
		memset(a, 0, sizeof(a));
	}
}A;
int n, k;
node operator*(node a, node b)//重载运算符
{
	node c;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			for(int k = 1; k <= n; k++)
				c.a[i][j] += (a.a[i][k] % Mod) * (b.a[k][j] % Mod) % Mod, c.a[i][j] %= Mod;
	return c;
}
node quickpow(node a, int b)
{
	node ans;
	for(int i = 1; i <= n; i++)
		ans.a[i][i] = 1;
	while(b != 0)
	{
		if(b & 1)
			ans = ans * a;
		a = a * a;
		b >>= 1;
	}
	return ans;
}
int main()
{
	cin >> n >> k;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			cin >> A.a[i][j];
	node c = quickpow(A, k);
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= n; j++)
			cout << c.a[i][j] << " ";
		cout << "\n";
	}
	return 0;
}