#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<algorithm>#include<map>#include<vector>#include<queue>#define ll long longusing namespace std;ll n,d,dist[40005];int vis[40005],flag = 0;ll a[40005];void spfa(){    flag++;    memset(dist,0,sizeof(dist));    queue<int> q;    q.push(0);    ll now,nxt,step;    while(!q.empty()){        now = q.front();        q.pop();        vis[now] = 0;        for(int i = 1;i <= n;i++){            if(a[i] == 0) continue;            step = dist[now] + a[i];            nxt = now + a[i];            if(nxt >= d){                nxt %= d;            }            if(dist[nxt] > step || dist[nxt] == 0){                dist[nxt] = step;                if(vis[nxt] != flag){                    vis[nxt] = flag;                    q.push(nxt);                }            }        }    }}int main(){    freopen("math.in","r",stdin);    freopen("math.out","w",stdout);    while(scanf("%d%d",&n,&d)){        if(!n && !d) break;        for(int i = 1;i <= n;i++){            scanf("%d",&a[i]);        }        spfa();        if(!(dist[0]/d))cout<<1<<endl;        else cout<<dist[0]/d<<endl;    }    return 0;}