The odd positive integers $1,3,5,7,\cdots,$ are arranged into in five columns continuing with the pattern shown on the right.  Counting from the left, the column in which $ 1985$ appears in is the

[asy]
int i,j;
for(i=0; i<4; i=i+1) {
label(string(16*i+1), (2*1,-2*i));
label(string(16*i+3), (2*2,-2*i));
label(string(16*i+5), (2*3,-2*i));
label(string(16*i+7), (2*4,-2*i));
}
for(i=0; i<3; i=i+1) {
for(j=0; j<4; j=j+1) {
label(string(16*i+15-2*j), (2*j,-2*i-1));
}}
dot((0,-7)^^(0,-9)^^(2*4,-8)^^(2*4,-10));
for(i=-10; i<-6; i=i+1) {
for(j=1; j<4; j=j+1) {
dot((2*j,i));
}}
[/asy]

$ \textbf{(A)} \text{ first} \qquad \textbf{(B)} \text{ second} \qquad \textbf{(C)} \text{ third} \qquad \textbf{(D)} \text{ fourth} \qquad \textbf{(E)} \text{ fifth}$
To determine the column in which the number 1985 appears, we need to understand the pattern in which the odd positive integers are arranged. The pattern is as follows:

1. The first column contains numbers of the form \(1 + 16k\) where \(k\) is a non-negative integer.
2. The second column contains numbers of the form \(3 + 16k\).
3. The third column contains numbers of the form \(5 + 16k\).
4. The fourth column contains numbers of the form \(7 + 16k\).
5. The fifth column contains numbers of the form \(9 + 16k\).

We need to find the value of \(k\) such that \(1985\) fits one of these forms. We start by checking the first column:

1. Check if \(1985\) can be written as \(1 + 16k\):
   \[
   1985 = 1 + 16k \implies 1984 = 16k \implies k = \frac{1984}{16} = 124
   \]
   Since \(k = 124\) is an integer, \(1985\) fits the form \(1 + 16k\).

Thus, \(1985\) is in the first column.

The final answer is \(\boxed{\text{first}}\).