import java.io.*;
import java.util.*;

import static java.util.Arrays.*;

class FastScanner { // {{{
  private final InputStream in = System.in;
  private final byte[] buffer = new byte[1024];
  private int ptr = 0;
  private int buflen = 0;
  private boolean hasNextByte() {
    if(ptr < buflen) { return true; }
    ptr = 0;
    try {
      buflen = in.read(buffer);
    } catch(IOException ex) {
      ex.printStackTrace();
    }
    if(buflen <= 0) { return false; }
    return true;
  }
  private int readByte() { if(hasNextByte()) { return buffer[ptr++]; } return -1; }
  private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; }
  private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) { ptr++; } }
  public boolean hasNext() { skipUnprintable(); return hasNextByte(); }
  public String next() {
    if(!hasNext()) { throw new NoSuchElementException(); }
    StringBuilder sb = new StringBuilder();
    int b = readByte();
    while(isPrintableChar(b)) {
      sb.appendCodePoint(b);
      b = readByte();
    }
    return sb.toString();
  }
  public long nextLong() {
    if(!hasNext()) { throw new NoSuchElementException(); }
    long n = 0;
    boolean minus = false;
    int b = readByte();
    if(b == '-') {
      minus = true;
      b = readByte();
    }
    if(b < '0' || '9' < b) { throw new NumberFormatException(); }
    while(true) {
      if('0' <= b && b <= '9') {
        n *= 10;
        n += b - '0';
      } else if(b == -1 || !isPrintableChar(b)) {
        return minus ? -n : n;
      } else {
        throw new NumberFormatException();
      }
      b = readByte();
    }
  }
} // }}}

class LowerBound<T extends Comparable<? super T>> implements Comparator<T> {
  public int compare(T x, T y) { return x.compareTo(y) >= 0 ? 1 : -1; }
}
class UpperBound<T extends Comparable<? super T>> implements Comparator<T> {
  public int compare(T x, T y) { return x.compareTo(y) > 0  ? 1 : -1; }
}

public class Main {
  private void solve() {
    FastScanner sc = new FastScanner();
    int n = (int)sc.nextLong(),
        m = (int)sc.nextLong();
    Long[] a = new Long[n];
    for(int i=0; i<n; ++i) { a[i] = sc.nextLong(); }
    sort(a);
    Comparator<Long> upperBound = new UpperBound<>(),
                     lowerBound = new LowerBound<>();
    PrintWriter out = new PrintWriter(System.out);
    for(int i=0; i<m; ++i) {
      if(i > 0) { out.print(' '); }
      long bi = sc.nextLong();
      int p = ~binarySearch(a, bi, upperBound) - ~binarySearch(a, bi, lowerBound);
      out.print(p);
    }
    out.println();
    out.flush();
  }

  public static void main(String[] args) {
    new Main().solve();
  }
}