public static void solve() {
		taken = new boolean[61][61][61];
		p = new int[181];
		c = new int[181];
		for (int i = 0; i < d.length; i++)
			for (int j = 0; j < d.length; j++)
				for (int k = 0; k < d.length; k++) {
					p[d[i] + d[j] + d[k]]++;
					if (!taken[d[i]][d[j]][d[k]]) {
						taken[d[i]][d[j]][d[k]] = true;
						taken[d[i]][d[k]][d[j]] = true;
						taken[d[j]][d[i]][d[k]] = true;
						taken[d[j]][d[k]][d[i]] = true;
						taken[d[k]][d[i]][d[j]] = true;
						taken[d[k]][d[j]][d[i]] = true;
						c[d[i] + d[j] + d[k]]++;
					}
				}
	}