#include <iostream>
using namespace std;

bool T(int n, int div, int a[])
{
    if(n == 1)
    {
        if(a[0] % div == 0)
        {
            cout << "Divisible";
            return true;
        }
        else
            return false;
    }

    for(int i = 0; i < n; i++)
    {
        for(int j = i+1; j < n; j++)
        {
            int t1, t2;
            t1 = a[i];
            t2 = a[j];
            a[j] = a[n-1];

            a[i] = t1 + t2;
            if(T(n-1, div, a))
                return true;

            a[i] = t1 - t2;
            if(T(n-1, div, a))
                return true;

            a[i] = t1;
            a[j] = t2;
        }
    }
}


int main()
{
    int n;
    cin >> n;
    int div;
    cin >> div;
    int a[10001];
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    T(n, div, a);
    if(!T(n, div, a))
        cout << "Not divisible";
    return 0;
}