static int sSearch(int a[], int v, int l, int r)
  {
    int i;
    for (i = l; i <= r; i++)
      if (v == a[i]) return i;
    return -1;
  }

static int bSearch(int a[], int v, int l, int r)
  {
    while (r >= l)
      {
        int m = (l+r)/2;
        if (v == a[m]) return m;
        if (v < a[m])
            r = m-1;
        else
            l = m+1;
      }
    return -1;
  }