Easy Multiple
Tag(s):

## Easy

Problem
Editorial
Analytics

If we list all the natural numbers below 10 that are multiples of 3 or 5 , we get 3, 5, 6, and 9. The sum of these multiples is 23 .

Find the sum of all the multiples of 3 or 5 below N .

Input Format

First line contains T that denotes the number of test cases. This is followed by T lines, each containing an integer, N .

Constraints 1 ≤ T ≤ 10^5 1 ≤ N ≤ 10^9

Output Format

For each test case, print an integer that denotes the sum of all the multiples of 3 or 5 below . N

SAMPLE INPUT
2
10
100
SAMPLE OUTPUT
23
2318
Time Limit: 5.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Swift-4.1, TypeScript, Visual Basic

## CODE EDITOR

Initializing Code Editor...

## This Problem was Asked in

Challenge Name

Code-Camp

OTHER PROBLEMS OF THIS CHALLENGE
• Algorithms > String Algorithms
• Algorithms > String Algorithms
• Basic Programming > Implementation
• Math > Basic Math