Sort program in C language becomes Segmentation fault

#include<stdio.h>
# include <stdlib.h>

#define MAX_A10
#define MAX_B100

void quickSort(int(*E)[MAX_B]);
void q_sort(int*E, int left, int right);

int main(void){
  inti,j;
  int E[MAX_A][MAX_B];

  for(i=0;i<MAX_A;i++){
    for(j=0;j<MAX_B;j++){
      E[i][j]=land()%MAX_B;
    }
  }

  quickSort(E);
  for(i=0;i<MAX_A;i++){
    for(j=0;j<MAX_B;j++){
      printf("%d\t", E[i][j]);
    }
    printf("\n");
  }

  return 0;
}

void quickSort(int(*E)[MAX_B]){
  inti;
  for(i=0;i<MAX_B;i++){
    q_sort(E[i], 0, MAX_B-1);
  }
}

void q_sort(int*E, int left, int right) {
  int pivot, l_hold, r_hold;

  l_hold = left;
  r_hold = right;
  pivot = E[left];

  while(left<right) {
    while((E[right]>=pivot)&(left<right)){
      right--;
    }
    if(left!=right){
      E[left] = E[right];
      left++;
    }
    while((E[left]<=pivot)&(left<right)){ 
      left++;
    }
    if(left!=right){
      E[right] = E[left];
      right--;
    }
  }
  E[left] = pivot;
  pivot = left;
  left = l_hold;
  right = r_hold;
  if(left<pivot){
    q_sort(E,left,pivot-1);
  }
  if(right>pivot){
    q_sort(E,pivot+1,right);
  }
}