public static int nonDivisibleSubset(int k, List<Integer> s) {
        s=s.stream().map(item->item%k).collect(Collectors.toList());
        // Write your code here
        s=s.stream().sorted().collect(Collectors.toList());
        int max = 0;
        for (int i = 0; i < s.size(); i++) {
            List<Integer> ans = new ArrayList<>();
            ans.add(s.get(i));
            for (int j = i+1; j < s.size(); j++) {
                Integer needCheck = s.get(j);
                boolean match = true;
                for (Integer an : ans) {
                    if ((an + needCheck) % k == 0) {
                        match = false;
                        break;
                    }
                }
                if (match) {
                    ans.add(needCheck);
                }
            }
            if (max < ans.size()) {
                max = ans.size();
            }
        }
        return max;
    }