Marble + Magic

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
//void ga(int N,int *A){F(N)scanf("%d",A+i);}
inline bool gi(int &a){
    char c;
    bool lwr=false;
    while((c=getchar_unlocked())&&(c<'0'||c>'9')&&c!='-'&&c!=-1);
    if(!c||c==-1)return false;
    if(c=='-')
        a=0,lwr=true;
    else
        a=c-'0';
    while((c=getchar_unlocked())&&c>='0'&&c<='9')
        a*=10,a+=c-'0';
    if(lwr)
        a=-a;
    return true;
}
inline void pn(int k){
    if(!k){putchar_unlocked('0');return;}
    int l(0),i(0),j(0);
    while(k)
        l*=10,l+=k%10,k/=10,++i;
    while(j++<i)
        putchar_unlocked('0'+l%10),l/=10;
}
#define pc(C) (putchar_unlocked(C))
#define pe pc(10)
#define CS(H) (printf("Case "),pn(i+1),pc(':'),pc(32),pn(H),pc(10));
void ga(int N,int *A){F(N)gi(A[i]);}
#define MX (1<<14)
int cc,Q,N,A[MX],a,b;
int main(void){
    while(gi(N),gi(Q),N){
        ga(N,A),sort(A,A+N);
        printf("CASE# %d:\n",++cc);
        F(Q){
            gi(a);
            b=lower_bound(A,A+N,a)-A;
            if(b<N&&A[b]==a)pn(a),printf(" found at "),pn(b+1),pe;
            else pn(a),printf(" not found\n");
        }
    }
    return 0;
}