#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define MULT_TEST 0
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const int N = 302, M = 500005;
int n, f[10][N][N], ans[M];
vector<array<int, 3>> Q[N];
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void DFS(int dep, int l, int r) {
    if (l == r) {
        for (auto [s, t, id] : Q[l]) ans[id] = f[dep][s][t];
        return ;
    }
    int mid = (l + r) >> 1;
    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= n; j++) 
            f[dep + 1][i][j] = f[dep][i][j];
    for (int k = mid + 1; k <= r; k++) 
        for (int i = 1; i <= n; i++) {
            if (i == k) continue;
            for (int j = 1; j <= n; j++) {
                if (i == j || j == k) continue;
                f[dep + 1][i][j] = min(f[dep][i][k] + f[dep][k][j], f[dep + 1][i][j]);
            }
        }
    DFS(dep + 1, l, mid);
    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= n; j++) 
            f[dep + 1][i][j] = f[dep][i][j];
    for (int k = l; k <= mid; k++) 
        for (int i = 1; i <= n; i++) {
            if (i == k) continue;
            for (int j = 1; j <= n; j++) {
                if (i == j || j == k) continue;
                f[dep + 1][i][j] = min(f[dep][i][k] + f[dep][k][j], f[dep + 1][i][j]);
            }
        }
    DFS(dep + 1, mid + 1, r);
}
inline void Solve() {
    int q;
    n = read(), q = read();
    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= n; j++) 
            f[0][i][j] = read();
    for (int i = 1; i <= q; i++) {
        int s = read(), t = read(), p = read();
        Q[p].push_back({s, t, i});
    }
    DFS(0, 1, n);
    for (int i = 1; i <= q; i++) printf("%lld\n", ans[i]);
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}