uvaAllWalksOfLengthN__input

#include <stdio.h>
#define SIZE 10
int Graph[SIZE][SIZE];
int N;
int M;
void readCase()
{
	int i, j;
	for (i = 0; i < M; i++) for (j = 0; j < M; j++)
		scanf("%d", Graph[i][j]);
	scanf("%*d");
}
void solveCase()
{

}
void printCase()
{

}
int main() {
	while (2 == scanf("%d", &M, &N)) {
		readCase();
		solveCase();
		printCase();
	}
	return 0;
}