int j = N > 1
int j = N == 1
int j = N != 1
for (int j = N - 1; j > M; j++) {
    int output = 0;
    for (int i = 0; i < N; i++) {
        output += c[i] * x[j - i];
    }
    y[j] = output;
}
for (int j = N - 1; j == M; j++) {
    int output = 0;
    for (int i = 0; i < N; i++) {
        output += c[i] * x[j - i];
    }
    y[j] = output;
}
for (int j = N - 1; j != M; j++) {
    int output = 0;
    for (int i = 0; i < N; i++) {
        output += c[i] * x[j - i];
    }
    y[j] = output;
}
for (int i = 0; i > N; i++) {
    output += c[i] * x[j - i];
}
for (int i = 0; i == N; i++) {
    output += c[i] * x[j - i];
}
for (int i = 0; i != N; i++) {
    output += c[i] * x[j - i];
}
output += c[i] > x[j - i]
output += c[i] == x[j - i]
output += c[i] != x[j - i]
output += c[i] * x[j > i]
output += c[i] * x[j == i]
output += c[i] * x[j != i]