結果
問題 | No.914 Omiyage |
ユーザー |
![]() |
提出日時 | 2019-10-25 21:26:32 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 15 ms / 2,000 ms |
コード長 | 25,247 bytes |
コンパイル時間 | 2,312 ms |
コンパイル使用メモリ | 197,580 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-24 16:22:05 |
合計ジャッジ時間 | 3,220 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
ソースコード
//#pragma GCC optimize ("-O3")#include <bits/stdc++.h>using namespace std;//@起動時struct initon {initon() {cin.tie(0);ios::sync_with_stdio(false);cout.setf(ios::fixed);cout.precision(16);srand((unsigned) clock() + (unsigned) time(NULL));};} __initon;//衝突対策#define ws ___wsstruct T {int f, s, t;T() { f = -1, s = -1, t = -1; }T(int f, int s, int t) : f(f), s(s), t(t) {}bool operator<(const T &r) const {return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t;//return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 大きい順}bool operator>(const T &r) const {return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t;//return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 小さい順}bool operator==(const T &r) const {return f == r.f && s == r.s && t == r.t;}bool operator!=(const T &r) const {return f != r.f || s != r.s || t != r.t;}int operator[](int i) {assert(i < 3);return i == 0 ? f : i == 1 ? s : t;}};#define int long long#define ll long long#define double long double#define pow powl#define ull unsigned long longusing dou = double;using itn = int;using str = string;using bo= bool;#define au autousing P = pair<ll, ll>;#define fi first#define se second#define vec vector#define beg begin#define rbeg rbegin#define con continue#define bre break#define brk break#define is ==//マクロ省略系 コンテナ//マクロ省略系 コンテナusing vi = vector<ll>;using vb = vector<bool>;using vs = vector<string>;using vd = vector<double>;using vc = vector<char>;using vp = vector<P>;using vt = vector<T>;#define vec vector#define o_vvt(o1, o2, o3, o4, name, ...) name#define vvt0(t) vec<vec<t>>#define vvt1(t, a) vec<vec<t>>a#define vvt2(t, a, b) vec<vec<t>>a(b)#define vvt3(t, a, b, c) vec<vec<t>> a(b,vec<t>(c))#define vvt4(t, a, b, c, d) vec<vec<t>> a(b,vec<t>(c,d))#define vvi(...) o_vvt(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(ll,__VA_ARGS__)#define vvb(...) o_vvt(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(bool,__VA_ARGS__)#define vvs(...) o_vvt(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(string,__VA_ARGS__)#define vvd(...) o_vvt(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(double,__VA_ARGS__)#define vvc(...) o_vvt(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(char,__VA_ARGS__)#define vvp(...) o_vvt(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(P,__VA_ARGS__)#define vvt(...) o_vvt(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(T,__VA_ARGS__)template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)#define v3i(a, b, c, d) vector<vector<vi>> a(b, vector<vi>(c, vi(d)))#define v3d(a, b, c, d) vector<vector<vd>> a(b, vector<vd>(c, vd(d)))#define v3m(a, b, c, d) vector<vector<vm>> a(b, vector<vm>(c, vm(d)))#define _vvi vector<vi>#define _vvl vector<vl>#define _vvb vector<vb>#define _vvs vector<vs>#define _vvd vector<vd>#define _vvc vector<vc>#define _vvp vector<vp>#define PQ priority_queue<ll, vector<ll>, greater<ll> >#define tos to_stringusing mapi = map<int, int>;using mapd = map<dou, int>;using mapc = map<char, int>;using maps = map<str, int>;using seti = set<int>;using setd = set<dou>;using setc = set<char>;using sets = set<str>;using qui = queue<int>;#define bset bitset#define uset unordered_set#define mset multiset#define umap unordered_map#define umapi unordered_map<int,int>#define umapp unordered_map<P,int>#define mmap multimap//マクロ 繰り返し#define _overloadrep(_1, _2, _3, _4, name, ...) name# define _rep(i, n) for(int i = 0,_lim=n; i < _lim ; i++)#define repi(i, m, n) for(int i = m,_lim=n; i < _lim ; i++)#define repadd(i, m, n, ad) for(int i = m,_lim=n; i < _lim ; i+= ad)#define rep(...) _overloadrep(__VA_ARGS__,repadd,repi,_rep,)(__VA_ARGS__)#define _rer(i, n) for(int i = n; i >= 0 ; i--)#define reri(i, m, n) for(int i = m,_lim=n; i >= _lim ; i--)#define rerdec(i, m, n, dec) for(int i = m,_lim=n; i >= _lim ; i-=dec)#define rer(...) _overloadrep(__VA_ARGS__,rerdec,reri,_rer,)(__VA_ARGS__)#define fora(a, b) for(auto&& a : b)//マクロ 定数#define k3 1010#define k4 10101#define k5 101010#define k6 1010101#define k7 10101010const int inf = (int) 1e9 + 100;const ll linf = (ll) 1e18 + 100;const double eps = 1e-9;const double PI = 3.1415926535897932384626433832795029L;ll ma = numeric_limits<ll>::min();ll mi = numeric_limits<ll>::max();const int y4[] = {-1, 1, 0, 0};const int x4[] = {0, 0, -1, 1};const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};//マクロ省略形 関数等#define arsz(a) (sizeof(a)/sizeof(a[0]))#define sz(a) ((int)(a).size())#define rs resize#define mp make_pair#define pb push_back#define pf push_front#define eb emplace_back#define all(a) (a).begin(),(a).end()#define rall(a) (a).rbegin(),(a).rend()inline void sort(string &a) { sort(a.begin(), a.end()); }template<class T> inline void sort(vector<T> &a) { sort(a.begin(), a.end()); };template<class T> inline void sort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len); };template<class T, class F> inline void sort(vector<T> &a, F f) { sort(a.begin(), a.end(), [&](T l, T r) { return f(l) < f(r); }); };enum ___pcomparator {fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd};inline void sort(vector<P> &a, ___pcomparator type) {switch (type) {case fisi:sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });break;case fisd:sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });break;case fdsi:sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });break;case fdsd:sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });break;case sifi:sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });break;case sifd:sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });break;case sdfi:sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });break;case sdfd:sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });break;}};inline void sort(vector<T> &a, ___pcomparator type) {switch (type) {case fisi:sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });break;casefisd:sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });break;casefdsi:sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });break;casefdsd:sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });break;casesifi:sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });break;casesifd:sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });break;casesdfi:sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });break;casesdfd:sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });break;}};template<class T> inline void rsort(vector<T> &a) { sort(a.begin(), a.end(), greater<T>()); };template<class T> inline void rsort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len, greater<T>()); };template<class U, class F> inline void rsort(vector<U> &a, F f) { sort(a.begin(), a.end(), [&](U l, U r) { return f(l) > f(r); }); };template<class U> inline void sortp(vector<U> &a, vector<U> &b) {vp c;int n = sz(a);assert(n == sz(b));rep(i, n)c.eb(a[i], b[i]);sort(c);rep(i, n) {a[i] = c[i].first;b[i] = c[i].second;;}};//F = T<T>//例えばreturn p.fi + p.se;template<class U, class F> inline void sortp(vector<U> &a, vector<U> &b, F f) {vp c;int n = sz(a);assert(n == sz(b));rep(i, n)c.eb(a[i], b[i]);sort(c, f);rep(i, n) {a[i] = c[i].first;b[i] = c[i].second;}};template<class U, class F> inline void sortp(vector<U> &a, vector<U> &b, char type) {vp c;int n = sz(a);assert(n == sz(b));rep(i, n)c.eb(a[i], b[i]);sort(c, type);rep(i, n) {a[i] = c[i].first;b[i] = c[i].second;}};template<class U> inline void rsortp(vector<U> &a, vector<U> &b) {vp c;int n = sz(a);assert(n == sz(b));rep(i, n)c.eb(a[i], b[i]);rsort(c);rep(i, n) {a[i] = c[i].first;b[i] = c[i].second;}};template<class U, class F> inline void rsortp(vector<U> &a, vector<U> &b, F f) {vp c;int n = sz(a);assert(n == sz(b));rep(i, n)c.eb(a[i], b[i]);rsort(c, f);rep(i, n) {a[i] = c[i].first;b[i] = c[i].second;}};template<class U> inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c) {vt r;int n = sz(a);assert(n == sz(b));assert(n == sz(c));rep(i, n)r.eb(a[i], b[i], c[i]);sort(r);rep(i, n) {a[i] = r[i].f;b[i] = r[i].s;c[i] = r[i].t;}};template<class U, class F> inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {vt r;int n = sz(a);assert(n == sz(b));assert(n == sz(c));rep(i, n)r.eb(a[i], b[i], c[i]);sort(r, f);rep(i, n) {a[i] = r[i].f;b[i] = r[i].s;c[i] = r[i].t;}};template<class U, class F> inline void rsortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {vt r;int n = sz(a);assert(n == sz(b));assert(n == sz(c));rep(i, n)r.eb(a[i], b[i], c[i]);rsort(r, f);rep(i, n) {a[i] = r[i].f;b[i] = r[i].s;c[i] = r[i].t;}};template<class T> inline void sort2(vector<vector<T>> &a) { for (int i = 0, n = a.size(); i < n; i++)sort(a[i]); }template<class T> inline void rsort2(vector<vector<T>> &a) { for (int i = 0, n = a.size(); i < n; i++)rsort(a[i]); }template<typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) { rep(i, N)a[i] = v; }template<typename A, size_t N, size_t O, typename T> void fill(A (&a)[N][O], const T &v) { rep(i, N)rep(j, O)a[i][j] = v; }template<typename A, size_t N, size_t O, size_t P, typename T> void fill(A (&a)[N][O][P], const T &v) { rep(i, N)rep(j, O)rep(k, P)a[i][j][k] = v; }template<typename A, size_t N, size_t O, size_t P, size_t Q, typename T> void fill(A (&a)[N][O][P][Q], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)a[i][j][k][l] = v; }template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, typename T> void fill(A (&a)[N][O][P][Q][R], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)a[i][j][k][l][m] = v; }template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S, typename T> void fill(A (&a)[N][O][P][Q][R][S], const T &v) { rep(i,N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)rep(n, S)a[i][j][k][l][m][n] = v; }template<typename V, typename T>void fill(V &xx, const T vall) {xx = vall;}template<typename V, typename T>void fill(vector<V> &vecc, const T vall) {for (auto &&vx: vecc) fill(vx, vall);}//@汎用便利関数 入力template<typename T = int> T _in() {T x;cin >> x;return (x);}#define _overloadin(_1, _2, _3, _4, name, ...) name#define in0() _in()#define in1(a) cin>>a#define in2(a, b) cin>>a>>b#define in3(a, b, c) cin>>a>>b>>c#define in4(a, b, c, d) cin>>a>>b>>c>>d#define in(...) _overloadin(__VA_ARGS__,in4,in3,in2 ,in1,in0)(__VA_ARGS__)#define _overloaddin(_1, _2, _3, _4, name, ...) name#define din1(a) int a;cin>>a#define din2(a, b) int a,b;cin>>a>>b#define din3(a, b, c) int a,b,c;cin>>a>>b>>c#define din4(a, b, c, d) int a,b,c,d;cin>>a>>b>>c>>d#define din(...) _overloadin(__VA_ARGS__,din4,din3,din2 ,din1)(__VA_ARGS__)#define _overloaddind(_1, _2, _3, _4, name, ...) name#define din1d(a) int a;cin>>a;a--#define din2d(a, b) int a,b;cin>>a>>b;a--,b--#define din3d(a, b, c) int a,b,c;cin>>a>>b>>c;a--,b--,c--#define din4d(a, b, c, d) int a,b,c,d;cin>>a>>b>>c>>d;;a--,b--,c--,d--#define dind(...) _overloaddind(__VA_ARGS__,din4d,din3d,din2d ,din1d)(__VA_ARGS__)string sin() { return _in<string>(); }ll lin() { return _in<ll>(); }#define na(a, n) a.resize(n); rep(nai,n) cin >> a[nai];#define nao(a, n) a.resize(n+1); rep(i,n) cin >> a[i+1];#define nad(a, n) a.resize(n); rep(i,n){ cin >> a[i]; a[i]--;}#define na2(a, b, n) a.resize(n),b.resize(n);rep(i, n)cin >> a[i] >> b[i];#define na2d(a, b, n) a.resize(n),b.resize(n);rep(i, n){cin >> a[i] >> b[i];a[i]--,b[i]--;}#define na3(a, b, c, n) a.resize(n),b.resize(n),c.resize(n); rep(i, n)cin >> a[i] >> b[i] >> c[i];#define na3d(a, b, c, n) a.resize(n),b.resize(n),c.resize(n); rep(i, n){cin >> a[i] >> b[i] >> c[i];a[i]--,b[i]--,c[i]--;}#define nt(a, h, w) a.resize(h);rep(i,h)a[i].resize(w); rep(hi,h)rep(wi,w) cin >> a[hi][wi];#define ntd(a, h, w) rs(a,h,w);rep(hi,h)rep(wi,w) cin >> a[hi][wi], a[hi][wi]--;#define ntp(a, h, w) fill(a,'#');rep(hi,1,h+1)rep(wi,1,w+1) cin >> a[hi][wi];#ifdef _DEBUGtemplate<class T> void err2(T &&head) { cerr << head; }template<class T, class... U> void err2(T &&head, U &&... tail) {cerr << head << " ";err2(tail...);}template<class T, class... U> void err(T &&head, U &&... tail) {cerr << head << " ";err2(tail...);cerr << "" << endl;}template<class T> void err(T &&head) { cerr << head << endl; }void err() { cerr << "" << endl; }template<class T> string out_m2(vector<T> &a, ll W = inf) {stringstream ss;if (W == inf)W = min(sz(a), 12ll);if (sz(a) == 0)return ss.str();rep(i, W) { ss << a[i] << " "; }return ss.str();}template<class T> string out_m2(vector<vector<T> > &a, ll H = inf, ll W = inf, int key = -1) {H = min({H, sz(a), 12ll});W = min({W, sz(a[0]), 12ll});stringstream ss;ss << endl;if (key == -1)ss << " *|"; else ss << " " << key << "|";rep(w, W)ss << std::right << std::setw(4) << w;ss << "" << endl;rep(w, W * 4 + 3)ss << "_";ss << "" << endl;rep(h, H) {ss << std::right << std::setw(2) << h << "|";rep(w, min(sz(a[h]), 12ll)) { if (abs(a[h][w]) == linf) ss << " e" << ""; else ss << std::right << std::setw(4) << a[h][w]; }ss << "" << endl;}return ss.str();}/*@formatter:off*/template<class T> string out_m2(vector<vector<vector<T> > > &a, ll H = inf, ll W = inf, ll U = inf) {stringstream ss; if (H == inf)H = 5; H =min(H, sz(a)); rep(i, H) { ss << endl; ss << out_m2(a[i], W, U, i); } return ss.str();}string out_m2(int a) {stringstream ss;ss << a;return ss.str();}template<class T> string out_m2(T &a) {stringstream ss;ss << a;return ss.str();}template<class T> string out_m(vector<T> &a, ll W = inf) {stringstream ss; if (W == inf)W = min(sz(a), 12ll); if(sz(a)==0)return ss.str(); rep(i, W) { ss << a[i] << " "; } ss << "" << endl; return ss.str();}template<class T> string out_m(vector<vector<T> > &a, ll H = inf, ll W = inf, int key = -1) {H = min({H, sz(a), 12ll});W = min({W, sz(a[0]), 12ll});stringstream ss;ss << endl;if (key == -1)ss << " *|"; else ss << " " << key << "|";rep(w, W)ss << std::right << std::setw(4) << w;ss << "" << endl;rep(w, W * 4 + 3)ss << "_";ss << "" << endl;rep(h, H) {ss << std::right << std::setw(2) << h << "|";rep(w, min(sz(a[h]),12ll)) { if (abs(a[h][w]) == linf) ss << " e" << ""; else ss << std::right << std::setw(4) << a[h][w]; }ss << "" << endl;}ss << endl;return ss.str();}/*@formatter:off*/template<class T> string out_m(vector<vector<vector<T> > > &a, ll H = inf, ll W = inf, ll U = inf) {stringstream ss; if (H == inf)H = 5; H =min(H, sz(a)); rep(i, H) { ss << endl; ss << out_m(a[i], W, U, i); } ss << endl; return ss.str();}string out_m(int a) {stringstream ss;ss << a << endl;return ss.str();}template<class T> string out_m(T &a) {stringstream ss;ss << a << endl;return ss.str();}template<class T> void outv(vector<T> &a, ll W=inf) {cout << out_m(a,W) << endl;}template<class T> void outv(vector<vector<T> > &a, ll H = linf, ll W = linf,int key=-1) { cout << out_m(a,H,W,key) << endl;}template<class T> void outv(vector<vector<vector<T> > > &a, ll H = linf, ll W = linf,ll U = linf) {cout << out_m(a,H,W,U)<< endl;}#elsetemplate<class T> void outv(vector<T> &a, ll W = inf) {rep(i, min(W, sz(a))) { cout << a[i] << " "; }cout << "" << endl;}template<class T> void outv(vector<vector<T> > &a, ll H = linf, ll W = linf, int key = -1) { rep(i, min(H, sz(a))) { outv(a[i], W); }}template<class T> void outv(vector<vector<vector<T> > > &a, ll H = linf, ll W = linf, ll U = linf) { ; }#define err(...);#endif#define debugName(VariableName) # VariableName#define deb1(x) debugName(x)<<" = "<<out_m2(x)#define deb2(x, ...) deb1(x) <<", "<< deb1(__VA_ARGS__)#define deb3(x, ...) deb1(x) <<", "<< deb2(__VA_ARGS__)#define deb4(x, ...) deb1(x) <<", "<< deb3(__VA_ARGS__)#define deb5(x, ...) deb1(x) <<", "<< deb4(__VA_ARGS__)#define deb6(x, ...) deb1(x) <<", "<< deb5(__VA_ARGS__)#define deb7(x, ...) deb1(x) <<", "<< deb6(__VA_ARGS__)#define deb8(x, ...) deb1(x) <<", "<< deb7(__VA_ARGS__)#define deb9(x, ...) deb1(x) <<", "<< deb8(__VA_ARGS__)#define deb10(x, ...) deb1(x) <<", "<< deb9(__VA_ARGS__)#define o_ebug(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name#ifdef _DEBUG#define deb(...) cerr<< o_ebug(__VA_ARGS__,deb10,deb9,deb8,deb7,deb6,deb5,deb4,deb3,deb2,deb1)(__VA_ARGS__) <<endl#else#define deb(...) ;#endif#define debugline(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n'void ole() {#ifdef _DEBUGdebugline("ole");exit(0);#endifstring a = "a";rep(i, 30)a += a;rep(i, 1 << 17)cout << a << endl;cout << "OLE 出力長制限超過" << endl;exit(0);}void tle() { while (inf)cout << inf << endl; }ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }ll gcd(vi b) {ll res = b[0];for (auto &&v :b)res = gcd(v, res);return res;}ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }ll rev(ll a) {ll res = 0;while (a) {res *= 10;res += a % 10;a /= 10;}return res;}template<class T> void rev(vector<T> &a) {reverse(all(a));}void rev(string &a) {reverse(all(a));}ll ceil(ll a, ll b) {if (b == 0) {debugline("ceil");deb(a, b);ole();return -1;} else return (a + b - 1) / b;}ll sqrt(ll a) {if (a < 0) {debugline("sqrt");deb(a);ole();}ll res = (ll) std::sqrt(a);while (res * res < a)res++;return res;}double log(double e, double x) { return log(x) / log(e); }ll sig(ll t) { return (1 + t) * t / 2; }ll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }vi divisors(int v) {vi res;double lim = std::sqrt(v);for (int i = 1; i <= lim; ++i) {if (v % i == 0) {res.pb(i);if (i != v / i)res.pb(v / i);}}return res;}vb isPrime;vi primes;void setPrime() {int len = 4010101;isPrime.resize(4010101);fill(isPrime, true);isPrime[0] = isPrime[1] = false;for (int i = 2; i <= sqrt(len) + 5; ++i) {if (!isPrime[i])continue;for (int j = 2; i * j < len; ++j) {isPrime[i * j] = false;}}rep(i, len)if (isPrime[i])primes.pb(i);}vi factorization(int v) {int tv = v;vi res;if (isPrime.size() == 0)setPrime();for (auto &&p :primes) {if (v % p == 0)res.push_back(p);while (v % p == 0) {v /= p;}if (v == 1 || p * p > tv)break;}if (v > 1)res.pb(v);return res;}inline bool inside(int h, int w, int H, int W) { return h >= 0 && w >= 0 && h < H && w < W; }inline bool inside(int v, int l, int r) { return l <= v && v < r; }#define ins insidell u(ll a) { return a < 0 ? 0 : a; }template<class T> vector<T> u(const vector<T> &a) {vector<T> ret = a;fora(v, ret)v = u(v);return ret;}#define MIN(a) numeric_limits<a>::min()#define MAX(a) numeric_limits<a>::max()void yn(bool a) {if (a)cout << "yes" << endl;else cout << "no" << endl;}void Yn(bool a) {if (a)cout << "Yes" << endl;else cout << "No" << endl;}void YN(bool a) {if (a)cout << "YES" << endl;else cout << "NO" << endl;}void fyn(bool a) {if (a)cout << "yes" << endl;else cout << "no" << endl;exit(0);}void fYn(bool a) {if (a)cout << "Yes" << endl;else cout << "No" << endl;exit(0);}void fYN(bool a) {if (a)cout << "YES" << endl;else cout << "NO" << endl;exit(0);}void Possible(bool a) {if (a)cout << "Possible" << endl;else cout << "Impossible" << endl;exit(0);}void POSSIBLE(bool a) {if (a)cout << "POSSIBLE" << endl;else cout << "IMPOSSIBLE" << endl;exit(0);}template<class T, class U> set<T> &operator+=(set<T> &a, U v) {a.insert(v);return a;}template<class T, class U> vector<T> &operator+=(vector<T> &a, U v) {a.pb(v);return a;}template<class T> T sum(vector<T> &v, int s = 0, int t = inf) {T ret = 0;rep(i, s, min(sz(v), t))ret += v[i];return ret;}void mod(int &a, int m) { a = (a % m + m) % m; }template<class F> inline int mgr(int ok, int ng, F f) {#define _mgrbody int mid = (ok + ng) / 2; if (f(mid))ok = mid; else ng = mid;if (ok < ng)while (ng - ok > 1) { _mgrbody } else while (ok - ng > 1) { _mgrbody }return ok;}template<class F> inline int mgr(int ok, int ng, int second, F f) {#define _mgrbody2 int mid = (ok + ng) / 2; if (f(mid, second))ok = mid; else ng = mid;if (ok < ng) while (ng - ok > 1) { _mgrbody2 } else while (ok - ng > 1) { _mgrbody2 }return ok;}template<typename T> ostream &operator<<(ostream &os, vector<T> &m) {for (auto &&v:m) os << v << " ";return os;}constexpr bool bget(ll m, int keta) { return (m >> keta) & 1; }int bget(ll m, int keta, int sinsuu) {m /= (ll) pow(sinsuu, keta);return m % sinsuu;}ll bit(int n) { return (1LL << (n)); }ll bit(int n, int sinsuu) { return (ll) pow(sinsuu, n); }int mask(int n) { return (1ll << n) - 1; }#define bcou __builtin_popcountlltemplate<class T> vector<T> ruiv(vector<T> &a) {vector<T> ret(a.size() + 1);rep(i, a.size())ret[i + 1] = ret[i] + a[i];return ret;}template<class T, class U> inline bool chma(T &a, const U &b) {if (a < b) {a = b;return true;}return false;}template<class U> inline bool chma(const U &b) { return chma(ma, b); }template<class T, class U> inline bool chmi(T &a, const U &b) {if (b < a) {a = b;return true;}return false;}template<class U> inline bool chmi(const U &b) { return chmi(mi, b); }#define unique(v) v.erase( unique(v.begin(), v.end()), v.end() );int max(vi &a) {int res = a[0];fora(v, a) {res = max(res, v);}return res;}int min(vi &a) {int res = a[0];fora(v, a) {res = min(res, v);}return res;}template<typename T> class fixed_point : T {public: explicit constexpr fixed_point(T &&t) noexcept: T(std::forward<T>(t)) {} template<typename... Args> constexpr decltype(auto) operator()(Args &&... args) const { return T::operator()(*this, std::forward<Args>(args)...); }};template<typename T> static inline constexpr decltype(auto) fix(T &&t) noexcept { return fixed_point<T>{std::forward<T>(t)}; }/*@formatter:on*/int N, K, H, W;vi A, B, C;signed main() {int M;in(N, M, K);vvi(A);nt(A, N, M);vvb(dp, 20, k5);dp[0][0] = 1;rep(i, N) {rep(j, k5) {rep(m, M) {if (dp[i][j]) {dp[i + 1][j + A[i][m]] = 1;}}}}deb(dp);rer(k,K){if(dp[N][k]){cout << K-k << endl;exit(0);}}cout << -1 << endl;}