Question: This is a rather easy challenge.

Challenge
=========

Input will contain a string (not `null` or empty) of maximum length 100. Output the number of vowels in each word of the string, separated by spaces.

Rules
=====

* The string will not be more than 100 characters in length.
* The string will only contain alphabets `A-Z` , `a-z` and can also contain spaces.
* Input must be consumed from the `stdin` or command line arguments.
* Output must be outputted in the `stdout`.
* You can write a full program, or a function that takes input from the `stdin` and outputs the result.
* The vowels that your program/function needs to count are `aeiou` and `AEIOU`.

Test Cases
==========

```
This is the first test case     --> 1 1 1 1 1 2
one plus two equals three       --> 2 1 1 3 2
aeiou AEIOU                     --> 5 5
psst                            --> 0
the quick brown fox jumped over the lazy dog --> 1 2 1 1 2 2 1 1 1

```

Scoring
=======

This is [code-golf](/questions/tagged/code-golf "show questions tagged 'code-golf'"), so the shortest submission (in bytes) wins.

Answer: 
CJam, ~~21~~ 19 bytes
=====================

```
r{el_"aeiou"--,Sr}h

```

**How it works**:

```
r{               }h    e# Read the first word and enter a do-while loop
  el_                  e# Convert the word into lower case and take a copy of it
     "aeiou"           e# All small caps vowels
            -          e# Remove all vowels from the copied word
             -         e# Remove all non-vowels from the original word
              ,        e# At this point, we have a string with all vowels of the word
                       e# Simply take its length
               S       e# Put a space after the number of vowel
                r      e# Read the next word. This serves as the truthy condition for the
                       e# do-while loop for us as if there are no word left, this returns
                       e# null/falsy and the do-while loop is exited

```

[Try it online here](http://cjam.aditsu.net/#code=r%7Bel_%22aeiou%22--%2CSr%7Dh&input=psst%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20)
JavaScript (*ES6*), 68
======================

I/O via popup. Run the snippet in Firefox to test.

```js
// As requested by OP

alert(prompt().replace(/\w+/g,w=>w.replace(/[^aeiou]/ig,'').length))

// Testable
f=s=>s.replace(/\w+/g,w=>w.replace(/[^aeiou]/ig,'').length)

test=[
 ['This is the first test case','1 1 1 1 1 2']
,['one plus two equals three','2 1 1 3 2']
,['aeiou AEIOU', '5 5']
]  

out=x=>O.innerHTML+=x+'\n'

test.forEach(t=>{
  r=f(t[0])
  out('Test '+ ['Fail','OK'][0|r==t[1]]
      +'\nInput:  '+ t[0]
      +'\nOutput: '+r
      +'\nCheck:  '+t[1]+'\n')
})
```

```html
<pre id=O></pre>
```