#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define esper(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
void SOLVE(){
  int n,m;
  cin>>n>>m;
  vector<ll>e(n);
  cin>>e;
  vector<pair<ll,ll>>a(m);
  cin>>a;
  vector<ll>we(1<<m,0),ve(1<<m,0);
  rep(i,1<<m){
    rep(j,m)if(i>>j&1){
      we[i]+=a[j].second;
      ve[i]+=a[j].first;
    }
  }
  vector<vector<ll>>dp(n+1,vector<ll>(1<<m,-2e18));
  dp[0][0]=0;
  rep(i,n){
    rep(j,1<<m)if(dp[i][j]!=-2e9){
      rep(k,1<<m){
        k|=j;
        if(we[j^k]<=e[i])chmax(dp[i+1][k],dp[i][j]+ve[j^k]);
      }
    }
  }
  ll ans=-1;
  int s=-1;
  rep(i,1<<m)if(chmax(ans,dp[n][i]))s=i;
  cout<<ans<<endl;
  vector<vector<int>>nimotsu(n);
  for(int i=n-1;i>=0;i--){
    int nxts=-1;
    for(int ns=s;;ns=(ns-1)&s){
      if(we[ns]<=e[i]&&dp[i][ns^s]+ve[ns]==dp[i+1][s]){
        nxts=ns;
        break;
      }
      if(ns==0)break;
    }
    assert(nxts!=-1);
    rep(j,m)if(nxts>>j&1)nimotsu[i].push_back(j);
    s^=nxts;
  }
  assert(s==0);
  rep(i,n){
    cout<<nimotsu[i].size();
    rep(j,nimotsu[i].size())cout<<' '<<nimotsu[i][j]+1;
    cout<<endl;
  }
}