here in 2-D array, row tells ( say X[p][q]) the domain that we are supposed to use in the given array in the calculation of subset sum.. here we will be using elements from a[1] to a[p] only not a[p+1] or a[p+2] ... if total elements in given array = n ..so we can use maximum n elements ..that's why row (max) = n = no of elements of given array.
X[p][q] -> subset sum = q or not ..where elements used in calculation of subset sum = a[1] , a[2] , ....a[p] ..
now coming to the the column -
here column says what is the value of desired subset sum ..min = 0 and max = W ( so total column = W+1) ..
your example- Say an array X[3,2]={1,2,3}.
here given array = a = {1, 2, 3}
X[3,2] = > can we have subset sum =2 in array = { 1, 2, 3} ...[ see here p = 3 ..so using all elements ]
X[3,2] = should be 1 , since subset sum = 2 is there [ take only 2nd element of array ]