import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
      }
      auto B = new long[M];
      foreach (j; 0 .. M) {
        B[j] = readLong;
      }
      
      alias Entry = Tuple!(long, "p", long, "q", int, "i", int, "j");
      BinaryHeap!(Array!Entry, "((a.p * b.q != b.p * a.q) ? (a.p * b.q < b.p * a.q) : (a.i > b.i))") que;
      foreach (i; 0 .. N) {
        que.insert(Entry(A[i], B[0], i, 0));
      }
      foreach (_; 0 .. M) {
        const e = que.front;
        que.removeFront;
        writeln(e.i + 1);
        if (e.j + 1 < M) {
          que.insert(Entry(A[e.i], B[e.j + 1], e.i, e.j + 1));
        }
      }
      debug {
        writeln("========");
      }
    }
  } catch (EOFException e) {
  }
}