// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>
#include <bits/stdc++.h>
#include <chrono>
#include <random>
// @author: Vlapos
namespace operators
{
template <typename T1, typename T2>
std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
{
in >> x.first >> x.second;
return in;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
{
out << x.first << " " << x.second;
return out;
}
template <typename T1>
std::istream &operator>>(std::istream &in, std::vector<T1> &x)
{
for (auto &i : x)
in >> i;
return in;
}
template <typename T1>
std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
{
for (auto &i : x)
out << i << " ";
return out;
}
template <typename T1>
std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
{
for (auto &i : x)
out << i << " ";
return out;
}
}
// name spaces
using namespace std;
using namespace operators;
// end of name spaces
// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines
// usefull stuff
void boost()
{
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }
const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};
const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;
#define int ll
struct test
{
vector<vector<int>> graph, cost, G;
int n, m, k;
bool check(int X)
{
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (graph[i][j] < BIG)
G[i][j] = -(cost[i][j] - X * (graph[i][j]));
else
G[i][j] = INF;
for (int k = 0; k < n; ++k)
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
for (int i = 0; i < n; ++i)
if (G[i][i] <= 0)
return true;
return false;
}
void solve(int testcase)
{
boost();
cin >> n >> m >> k;
graph.resize(n, vector<int>(n, BIG));
cost.resize(n, vector<int>(n, 0));
G.resize(n, vector<int>(n));
vector<vector<int>> b(n, vector<int>(k));
vector<vector<int>> s(n, vector<int>(k));
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < k; ++j)
cin >> b[i][j] >> s[i][j];
}
for (int i = 0; i < m; ++i)
{
int v, tov, c;
cin >> v >> tov >> c;
--v, --tov;
graph[v][tov] = c;
}
for (int k = 0; k < n; ++k)
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (i != j)
{
graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j]);
}
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
for (int el = 0; el < k; ++el)
if (b[i][el] > -1 and s[j][el])
cost[i][j] = max(cost[i][j], s[j][el] - b[i][el]);
int L = 0, R = 1e9 + 100;
while (R - L > 1)
{
int M = (L + R) >> 1;
if (check(M))
{
L = M;
}
else
{
R = M;
}
}
cout << L << "\n";
}
};
main()
{
boost();
int q = 1;
// cin >> q;
for (int i = 0; i < q; i++)
{
test t;
t.solve(i);
}
return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
// //
// Coded by Der_Vlἀpos //
// //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
