import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf = 1<<30;
enum mod = 10L^^9 + 7;

void main() {
    int n, a;
    scan(n, a);
    auto x = readln.split.to!(int[]);
    x[] -= a;

    immutable ofs = n * 50;
    auto dp = new long[](ofs * 2 + 1);
    dp[x[0] + ofs] = 1;

    foreach (i ; 1 .. n) {
        if (x[i] > 0) {
            foreach_reverse (j ; x[i] .. 2*ofs + 1) {
                dp[j] += dp[j - x[i]];
            }
        }
        else {
            foreach (j ; 0 .. 2*ofs + 1 + x[i]) {
                dp[j] += dp[j - x[i]];
            }
        }

        dp[x[i] + ofs]++;
    }

    writeln(dp[ofs]);
}














































void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
