#include <bits/stdc++.h>
using namespace std;

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> nap(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> nap[i];
  }
  vector<int> h(m);
  for (int i = 0; i < m; i++) {
    cin >> h[i];
  }
  sort(h.begin(), h.end());
  int a = 1;
  int marad = nap[a];
  int eddig = 0;
  for (int i = 0; i < m; i++) {
    cout << "a " << a << "i " << i << "hi " << h[i] << endl;
    while (a > h[i]) {
      a++;
      if(a > n){
        cout << "d " << eddig;
        return 0;
      }
      marad = nap[a];
    }
    while(marad == 0){
      a++;
      if(a > n){
        cout << "c " << eddig;
        return 0;
      }
      marad = nap[a];
    }
    if (marad > 0 && a <= h[i]) {
      marad--;
      eddig++;
    }
  }
  cout << " b " << eddig;
}